tommath/bn_fast_mp_montgomery_reduce.c

177 lines
4.7 KiB
C
Raw Normal View History

#include <tommath_private.h>
2004-10-29 18:07:18 -04:00
#ifdef BN_FAST_MP_MONTGOMERY_REDUCE_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.
*
* Tom St Denis, tstdenis82@gmail.com, http://libtom.org
2003-02-28 11:08:34 -05:00
*/
2003-12-24 13:59:22 -05:00
/* computes xR**-1 == x (mod N) via Montgomery Reduction
*
2004-10-29 18:07:18 -04:00
* This is an optimized implementation of montgomery_reduce
2003-02-28 11:09:08 -05:00
* which uses the comba method to quickly calculate the columns of the
2003-12-24 13:59:22 -05:00
* reduction.
2003-02-28 11:09:08 -05:00
*
* Based on Algorithm 14.32 on pp.601 of HAC.
*/
2017-09-20 10:59:43 -04:00
int fast_mp_montgomery_reduce(mp_int *x, const mp_int *n, mp_digit rho)
2003-02-28 11:08:34 -05:00
{
2017-08-30 14:23:46 -04:00
int ix, res, olduse;
mp_word W[MP_WARRAY];
2017-10-15 13:58:35 -04:00
if (x->used > (int)MP_WARRAY) {
return MP_VAL;
}
2017-08-30 14:23:46 -04:00
/* get old used count */
olduse = x->used;
/* grow a as required */
if (x->alloc < (n->used + 1)) {
if ((res = mp_grow(x, n->used + 1)) != MP_OKAY) {
return res;
}
}
/* first we have to get the digits of the input into
* an array of double precision words W[...]
*/
{
mp_word *_W;
2017-08-30 14:23:46 -04:00
mp_digit *tmpx;
/* alias for the W[] array */
_W = W;
2003-02-28 11:08:34 -05:00
2017-08-30 14:23:46 -04:00
/* alias for the digits of x*/
tmpx = x->dp;
2003-02-28 11:09:08 -05:00
2017-08-30 14:23:46 -04:00
/* copy the digits of a into W[0..a->used-1] */
for (ix = 0; ix < x->used; ix++) {
*_W++ = *tmpx++;
}
2003-02-28 11:08:34 -05:00
2017-08-30 14:23:46 -04:00
/* zero the high words of W[a->used..m->used*2] */
for (; ix < ((n->used * 2) + 1); ix++) {
*_W++ = 0;
2003-02-28 11:08:34 -05:00
}
2017-08-30 14:23:46 -04:00
}
/* now we proceed to zero successive digits
* from the least significant upwards
*/
for (ix = 0; ix < n->used; ix++) {
/* mu = ai * m' mod b
*
* We avoid a double precision multiplication (which isn't required)
* by casting the value down to a mp_digit. Note this requires
* that W[ix-1] have the carry cleared (see after the inner loop)
*/
mp_digit mu;
2017-10-15 13:58:35 -04:00
mu = ((W[ix] & MP_MASK) * rho) & MP_MASK;
2017-08-30 14:23:46 -04:00
/* a = a + mu * m * b**i
*
* This is computed in place and on the fly. The multiplication
* by b**i is handled by offseting which columns the results
* are added to.
*
* Note the comba method normally doesn't handle carries in the
* inner loop In this case we fix the carry from the previous
* column since the Montgomery reduction requires digits of the
* result (so far) [see above] to work. This is
* handled by fixing up one carry after the inner loop. The
* carry fixups are done in order so after these loops the
* first m->used words of W[] have the carries fixed
*/
{
int iy;
mp_digit *tmpn;
mp_word *_W;
/* alias for the digits of the modulus */
tmpn = n->dp;
/* Alias for the columns set by an offset of ix */
_W = W + ix;
/* inner loop */
for (iy = 0; iy < n->used; iy++) {
2017-10-15 13:58:35 -04:00
*_W++ += (mp_word)mu * (mp_word)*tmpn++;
2017-08-30 14:23:46 -04:00
}
}
/* now fix carry for next digit, W[ix+1] */
2017-10-15 13:58:35 -04:00
W[ix + 1] += W[ix] >> (mp_word)DIGIT_BIT;
2017-08-30 14:23:46 -04:00
}
/* now we have to propagate the carries and
* shift the words downward [all those least
* significant digits we zeroed].
*/
{
mp_digit *tmpx;
mp_word *_W, *_W1;
/* nox fix rest of carries */
/* alias for current word */
_W1 = W + ix;
/* alias for next word, where the carry goes */
_W = W + ++ix;
for (; ix <= ((n->used * 2) + 1); ix++) {
2017-10-15 13:58:35 -04:00
*_W++ += *_W1++ >> (mp_word)DIGIT_BIT;
2017-08-30 14:23:46 -04:00
}
/* copy out, A = A/b**n
*
* The result is A/b**n but instead of converting from an
* array of mp_word to mp_digit than calling mp_rshd
* we just copy them in the right order
*/
/* alias for destination word */
tmpx = x->dp;
/* alias for shifted double precision result */
_W = W + n->used;
for (ix = 0; ix < (n->used + 1); ix++) {
2017-10-15 13:58:35 -04:00
*tmpx++ = *_W++ & (mp_word)MP_MASK;
2017-08-30 14:23:46 -04:00
}
/* zero oldused digits, if the input a was larger than
* m->used+1 we'll have to clear the digits
*/
for (; ix < olduse; ix++) {
*tmpx++ = 0;
}
}
/* set the max used and clamp */
x->used = n->used + 1;
mp_clamp(x);
/* if A >= m then A = A - m */
if (mp_cmp_mag(x, n) != MP_LT) {
return s_mp_sub(x, n, x);
}
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
2017-08-28 10:27:26 -04:00
/* ref: $Format:%D$ */
/* git commit: $Format:%H$ */
/* commit time: $Format:%ai$ */