libtommath/mp_montgomery_setup.c

41 lines
1.1 KiB
C
Raw Normal View History

#include "tommath_private.h"
#ifdef MP_MONTGOMERY_SETUP_C
2019-04-07 13:29:11 +00:00
/* LibTomMath, multiple-precision integer library -- Tom St Denis */
/* SPDX-License-Identifier: Unlicense */
2003-02-28 16:08:34 +00:00
/* setups the montgomery reduction stuff */
mp_err mp_montgomery_setup(const mp_int *n, mp_digit *rho)
2003-02-28 16:08:34 +00:00
{
2017-08-30 17:11:35 +00:00
mp_digit x, b;
2003-02-28 16:08:34 +00:00
2017-08-30 17:11:35 +00:00
/* fast inversion mod 2**k
*
* Based on the fact that
*
* XA = 1 (mod 2**n) => (X(2-XA)) A = 1 (mod 2**2n)
* => 2*X*A - X*X*A*A = 1
* => 2*(1) - (1) = 1
*/
b = n->dp[0];
2003-02-28 16:08:34 +00:00
2017-10-15 17:57:12 +00:00
if ((b & 1u) == 0u) {
2017-08-30 17:11:35 +00:00
return MP_VAL;
}
2003-02-28 16:08:34 +00:00
2017-10-15 17:57:12 +00:00
x = (((b + 2u) & 4u) << 1) + b; /* here x*a==1 mod 2**4 */
x *= 2u - (b * x); /* here x*a==1 mod 2**8 */
x *= 2u - (b * x); /* here x*a==1 mod 2**16 */
#if defined(MP_64BIT) || !(defined(MP_16BIT))
2017-10-15 17:57:12 +00:00
x *= 2u - (b * x); /* here x*a==1 mod 2**32 */
2003-05-17 12:33:54 +00:00
#endif
#ifdef MP_64BIT
2017-10-15 17:57:12 +00:00
x *= 2u - (b * x); /* here x*a==1 mod 2**64 */
2003-05-17 12:33:54 +00:00
#endif
2003-02-28 16:08:34 +00:00
2017-08-30 17:11:35 +00:00
/* rho = -1/m mod b */
2019-04-13 06:46:57 +00:00
*rho = (mp_digit)(((mp_word)1 << (mp_word)MP_DIGIT_BIT) - x) & MP_MASK;
2003-02-28 16:08:34 +00:00
2017-08-30 17:11:35 +00:00
return MP_OKAY;
2003-02-28 16:08:34 +00:00
}
2004-10-29 22:07:18 +00:00
#endif