tommath/bn_mp_exptmod_fast.c

288 lines
7.3 KiB
C
Raw Normal View History

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.
*
2003-03-12 21:11:11 -05:00
* Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org
2003-02-28 11:08:34 -05:00
*/
#include <tommath.h>
/* computes Y == G^X mod P, HAC pp.616, Algorithm 14.85
*
* Uses a left-to-right k-ary sliding window to compute the modular exponentiation.
* The value of k changes based on the size of the exponent.
*
2003-05-17 08:33:54 -04:00
* Uses Montgomery or Diminished Radix reduction [whichever appropriate]
2003-02-28 11:08:34 -05:00
*/
2003-07-02 11:39:39 -04:00
#ifdef MP_LOW_MEM
#define TAB_SIZE 32
#else
#define TAB_SIZE 256
#endif
2003-02-28 11:08:34 -05:00
int
2003-03-22 10:10:20 -05:00
mp_exptmod_fast (mp_int * G, mp_int * X, mp_int * P, mp_int * Y, int redmode)
2003-02-28 11:08:34 -05:00
{
2003-07-02 11:39:39 -04:00
mp_int M[TAB_SIZE], res;
2003-02-28 11:09:08 -05:00
mp_digit buf, mp;
int err, bitbuf, bitcpy, bitcnt, mode, digidx, x, y, winsize;
2003-05-29 09:35:26 -04:00
/* use a pointer to the reduction algorithm. This allows us to use
* one of many reduction algorithms without modding the guts of
* the code with if statements everywhere.
*/
2003-03-22 10:10:20 -05:00
int (*redux)(mp_int*,mp_int*,mp_digit);
2003-05-17 08:33:54 -04:00
2003-02-28 11:08:34 -05:00
/* find window size */
x = mp_count_bits (X);
if (x <= 7) {
winsize = 2;
} else if (x <= 36) {
winsize = 3;
} else if (x <= 140) {
winsize = 4;
} else if (x <= 450) {
winsize = 5;
} else if (x <= 1303) {
winsize = 6;
} else if (x <= 3529) {
winsize = 7;
} else {
winsize = 8;
}
2003-05-17 08:33:54 -04:00
#ifdef MP_LOW_MEM
if (winsize > 5) {
winsize = 5;
}
#endif
2003-07-02 11:39:39 -04:00
/* init M array */
/* init first cell */
if ((err = mp_init(&M[1])) != MP_OKAY) {
return err;
}
2003-05-17 08:33:54 -04:00
2003-07-02 11:39:39 -04:00
/* now init the second half of the array */
for (x = 1<<(winsize-1); x < (1 << winsize); x++) {
if ((err = mp_init(&M[x])) != MP_OKAY) {
for (y = 1<<(winsize-1); y < x; y++) {
2003-05-17 08:33:54 -04:00
mp_clear (&M[y]);
2003-02-28 11:08:34 -05:00
}
2003-07-02 11:39:39 -04:00
mp_clear(&M[1]);
2003-02-28 11:08:34 -05:00
return err;
}
}
2003-05-17 08:33:54 -04:00
2003-05-29 09:35:26 -04:00
/* determine and setup reduction code */
2003-03-22 10:10:20 -05:00
if (redmode == 0) {
/* now setup montgomery */
if ((err = mp_montgomery_setup (P, &mp)) != MP_OKAY) {
goto __M;
}
2003-05-17 08:33:54 -04:00
/* automatically pick the comba one if available (saves quite a few calls/ifs) */
2003-05-29 09:35:26 -04:00
if (((P->used * 2 + 1) < MP_WARRAY) &&
2003-05-17 08:33:54 -04:00
P->used < (1 << ((CHAR_BIT * sizeof (mp_word)) - (2 * DIGIT_BIT)))) {
redux = fast_mp_montgomery_reduce;
} else {
2003-08-04 21:24:44 -04:00
/* use slower baseline Montgomery method */
2003-05-17 08:33:54 -04:00
redux = mp_montgomery_reduce;
}
2003-05-29 09:35:26 -04:00
} else if (redmode == 1) {
2003-08-04 21:24:44 -04:00
/* setup DR reduction for moduli of the form B**k - b */
2003-03-22 10:10:20 -05:00
mp_dr_setup(P, &mp);
redux = mp_dr_reduce;
2003-05-29 09:35:26 -04:00
} else {
2003-08-04 21:24:44 -04:00
/* setup DR reduction for moduli of the form 2**k - b */
2003-05-29 09:35:26 -04:00
if ((err = mp_reduce_2k_setup(P, &mp)) != MP_OKAY) {
goto __M;
}
redux = mp_reduce_2k;
2003-02-28 11:08:34 -05:00
}
/* setup result */
if ((err = mp_init (&res)) != MP_OKAY) {
2003-08-04 21:24:44 -04:00
goto __M;
2003-02-28 11:08:34 -05:00
}
/* create M table
*
* The M table contains powers of the input base, e.g. M[x] = G^x mod P
*
* The first half of the table is not computed though accept for M[0] and M[1]
*/
2003-02-28 11:09:08 -05:00
2003-03-22 10:10:20 -05:00
if (redmode == 0) {
/* now we need R mod m */
if ((err = mp_montgomery_calc_normalization (&res, P)) != MP_OKAY) {
goto __RES;
}
2003-02-28 11:08:34 -05:00
2003-03-22 10:10:20 -05:00
/* now set M[1] to G * R mod m */
if ((err = mp_mulmod (G, &res, P, &M[1])) != MP_OKAY) {
goto __RES;
}
} else {
mp_set(&res, 1);
if ((err = mp_mod(G, P, &M[1])) != MP_OKAY) {
goto __RES;
}
2003-02-28 11:08:34 -05:00
}
2003-05-17 08:33:54 -04:00
2003-02-28 11:08:34 -05:00
/* compute the value at M[1<<(winsize-1)] by squaring M[1] (winsize-1) times */
if ((err = mp_copy (&M[1], &M[1 << (winsize - 1)])) != MP_OKAY) {
goto __RES;
}
for (x = 0; x < (winsize - 1); x++) {
2003-02-28 11:09:08 -05:00
if ((err = mp_sqr (&M[1 << (winsize - 1)], &M[1 << (winsize - 1)])) != MP_OKAY) {
2003-02-28 11:08:34 -05:00
goto __RES;
}
2003-03-22 10:10:20 -05:00
if ((err = redux (&M[1 << (winsize - 1)], P, mp)) != MP_OKAY) {
2003-02-28 11:08:34 -05:00
goto __RES;
}
}
/* create upper table */
for (x = (1 << (winsize - 1)) + 1; x < (1 << winsize); x++) {
if ((err = mp_mul (&M[x - 1], &M[1], &M[x])) != MP_OKAY) {
goto __RES;
}
2003-03-22 10:10:20 -05:00
if ((err = redux (&M[x], P, mp)) != MP_OKAY) {
2003-02-28 11:08:34 -05:00
goto __RES;
}
}
/* set initial mode and bit cnt */
2003-05-17 08:33:54 -04:00
mode = 0;
bitcnt = 1;
buf = 0;
2003-02-28 11:08:34 -05:00
digidx = X->used - 1;
2003-05-29 09:35:26 -04:00
bitcpy = 0;
bitbuf = 0;
2003-02-28 11:08:34 -05:00
for (;;) {
/* grab next digit as required */
if (--bitcnt == 0) {
2003-08-04 21:24:44 -04:00
/* if digidx == -1 we are out of digits so break */
2003-02-28 11:08:34 -05:00
if (digidx == -1) {
2003-05-17 08:33:54 -04:00
break;
2003-02-28 11:08:34 -05:00
}
2003-08-04 21:24:44 -04:00
/* read next digit and reset bitcnt */
buf = X->dp[digidx--];
bitcnt = (int)DIGIT_BIT;
2003-02-28 11:08:34 -05:00
}
/* grab the next msb from the exponent */
2003-08-04 21:24:44 -04:00
y = (mp_digit)(buf >> (DIGIT_BIT - 1)) & 1;
2003-05-17 08:33:54 -04:00
buf <<= (mp_digit)1;
2003-02-28 11:08:34 -05:00
/* if the bit is zero and mode == 0 then we ignore it
* These represent the leading zero bits before the first 1 bit
* in the exponent. Technically this opt is not required but it
* does lower the # of trivial squaring/reductions used
*/
2003-05-17 08:33:54 -04:00
if (mode == 0 && y == 0) {
2003-02-28 11:08:34 -05:00
continue;
2003-05-17 08:33:54 -04:00
}
2003-02-28 11:08:34 -05:00
/* if the bit is zero and mode == 1 then we square */
if (mode == 1 && y == 0) {
if ((err = mp_sqr (&res, &res)) != MP_OKAY) {
2003-05-17 08:33:54 -04:00
goto __RES;
2003-02-28 11:08:34 -05:00
}
2003-03-22 10:10:20 -05:00
if ((err = redux (&res, P, mp)) != MP_OKAY) {
2003-05-17 08:33:54 -04:00
goto __RES;
2003-02-28 11:08:34 -05:00
}
continue;
}
/* else we add it to the window */
bitbuf |= (y << (winsize - ++bitcpy));
2003-08-04 21:24:44 -04:00
mode = 2;
2003-02-28 11:08:34 -05:00
if (bitcpy == winsize) {
2003-03-29 13:16:01 -05:00
/* ok window is filled so square as required and multiply */
2003-02-28 11:08:34 -05:00
/* square first */
for (x = 0; x < winsize; x++) {
2003-05-17 08:33:54 -04:00
if ((err = mp_sqr (&res, &res)) != MP_OKAY) {
goto __RES;
}
if ((err = redux (&res, P, mp)) != MP_OKAY) {
goto __RES;
}
2003-02-28 11:08:34 -05:00
}
/* then multiply */
if ((err = mp_mul (&res, &M[bitbuf], &res)) != MP_OKAY) {
2003-05-17 08:33:54 -04:00
goto __RES;
2003-02-28 11:08:34 -05:00
}
2003-03-22 10:10:20 -05:00
if ((err = redux (&res, P, mp)) != MP_OKAY) {
2003-05-17 08:33:54 -04:00
goto __RES;
2003-02-28 11:08:34 -05:00
}
/* empty window and reset */
2003-05-29 09:35:26 -04:00
bitcpy = 0;
bitbuf = 0;
2003-08-04 21:24:44 -04:00
mode = 1;
2003-02-28 11:08:34 -05:00
}
}
/* if bits remain then square/multiply */
if (mode == 2 && bitcpy > 0) {
/* square then multiply if the bit is set */
for (x = 0; x < bitcpy; x++) {
if ((err = mp_sqr (&res, &res)) != MP_OKAY) {
2003-05-17 08:33:54 -04:00
goto __RES;
2003-02-28 11:08:34 -05:00
}
2003-03-22 10:10:20 -05:00
if ((err = redux (&res, P, mp)) != MP_OKAY) {
2003-05-17 08:33:54 -04:00
goto __RES;
2003-02-28 11:08:34 -05:00
}
2003-08-04 21:24:44 -04:00
/* get next bit of the window */
2003-02-28 11:08:34 -05:00
bitbuf <<= 1;
if ((bitbuf & (1 << winsize)) != 0) {
2003-05-17 08:33:54 -04:00
/* then multiply */
if ((err = mp_mul (&res, &M[1], &res)) != MP_OKAY) {
goto __RES;
}
if ((err = redux (&res, P, mp)) != MP_OKAY) {
goto __RES;
}
2003-02-28 11:08:34 -05:00
}
}
}
2003-03-22 10:10:20 -05:00
if (redmode == 0) {
2003-08-04 21:24:44 -04:00
/* fixup result if Montgomery reduction is used
* recall that any value in a Montgomery system is
* actually multiplied by R mod n. So we have
* to reduce one more time to cancel out the factor
* of R.
*/
2003-03-22 10:10:20 -05:00
if ((err = mp_montgomery_reduce (&res, P, mp)) != MP_OKAY) {
goto __RES;
}
2003-05-17 08:33:54 -04:00
}
2003-02-28 11:08:34 -05:00
2003-08-04 21:24:44 -04:00
/* swap res with Y */
2003-02-28 11:08:34 -05:00
mp_exch (&res, Y);
err = MP_OKAY;
__RES:mp_clear (&res);
__M:
2003-07-02 11:39:39 -04:00
mp_clear(&M[1]);
for (x = 1<<(winsize-1); x < (1 << winsize); x++) {
2003-02-28 11:08:34 -05:00
mp_clear (&M[x]);
}
return err;
}