tommath/bn_mp_montgomery_setup.c

60 lines
1.5 KiB
C
Raw Normal View History

2004-10-29 18:07:18 -04:00
#include <tommath.h>
#ifdef BN_MP_MONTGOMERY_SETUP_C
2003-02-28 11:08:34 -05:00
/* LibTomMath, multiple-precision integer library -- Tom St Denis
*
2003-08-04 21:24:44 -04:00
* LibTomMath is a library that provides multiple-precision
2003-02-28 11:08:34 -05:00
* integer arithmetic as well as number theoretic functionality.
*
2003-08-04 21:24:44 -04:00
* The library was designed directly after the MPI library by
2003-02-28 11:08:34 -05:00
* Michael Fromberger but has been written from scratch with
* additional optimizations in place.
*
* The library is free for all purposes without any express
* guarantee it works.
*
2007-04-18 05:58:18 -04:00
* Tom St Denis, tomstdenis@gmail.com, http://libtom.org
2003-02-28 11:08:34 -05:00
*/
/* setups the montgomery reduction stuff */
int
2003-05-29 09:35:26 -04:00
mp_montgomery_setup (mp_int * n, mp_digit * rho)
2003-02-28 11:08:34 -05:00
{
2003-05-17 08:33:54 -04:00
mp_digit x, b;
2003-02-28 11:08:34 -05:00
2003-05-29 09:35:26 -04:00
/* fast inversion mod 2**k
2003-03-12 21:11:11 -05:00
*
2003-05-17 08:33:54 -04:00
* Based on the fact that
2003-03-12 21:11:11 -05:00
*
2003-05-29 09:35:26 -04:00
* 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
2003-03-12 21:11:11 -05:00
*/
2003-05-29 09:35:26 -04:00
b = n->dp[0];
2003-02-28 11:08:34 -05:00
2003-03-12 21:11:11 -05:00
if ((b & 1) == 0) {
return MP_VAL;
2003-02-28 11:08:34 -05:00
}
2003-05-29 09:35:26 -04:00
x = (((b + 2) & 4) << 1) + b; /* here x*a==1 mod 2**4 */
x *= 2 - b * x; /* here x*a==1 mod 2**8 */
2003-05-17 08:33:54 -04:00
#if !defined(MP_8BIT)
2003-05-29 09:35:26 -04:00
x *= 2 - b * x; /* here x*a==1 mod 2**16 */
2003-05-17 08:33:54 -04:00
#endif
#if defined(MP_64BIT) || !(defined(MP_8BIT) || defined(MP_16BIT))
2003-05-29 09:35:26 -04:00
x *= 2 - b * x; /* here x*a==1 mod 2**32 */
2003-05-17 08:33:54 -04:00
#endif
#ifdef MP_64BIT
2003-05-29 09:35:26 -04:00
x *= 2 - b * x; /* here x*a==1 mod 2**64 */
2003-05-17 08:33:54 -04:00
#endif
2003-02-28 11:08:34 -05:00
2003-05-29 09:35:26 -04:00
/* rho = -1/m mod b */
2006-12-24 11:12:36 -05:00
*rho = (unsigned long)(((mp_word)1 << ((mp_word) DIGIT_BIT)) - x) & MP_MASK;
2003-02-28 11:08:34 -05:00
2003-03-12 21:11:11 -05:00
return MP_OKAY;
2003-02-28 11:08:34 -05:00
}
2004-10-29 18:07:18 -04:00
#endif
2005-08-01 12:37:28 -04:00
/* $Source$ */
/* $Revision$ */
/* $Date$ */