libtommath/bn_mp_reduce_is_2k.c

46 lines
1.1 KiB
C
Raw Normal View History

2003-08-05 01:24:44 +00:00
/* LibTomMath, multiple-precision integer library -- Tom St Denis
*
* LibTomMath is a library that provides multiple-precision
* integer arithmetic as well as number theoretic functionality.
*
* The library was designed directly after the MPI library by
* 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, tomstdenis@iahu.ca, http://math.libtomcrypt.org
*/
#include <tommath.h>
/* determines if mp_reduce_2k can be used */
2003-12-24 18:59:22 +00:00
int mp_reduce_is_2k(mp_int *a)
2003-08-05 01:24:44 +00:00
{
2003-12-24 18:59:22 +00:00
int ix, iy, iz, iw;
2003-08-05 01:24:44 +00:00
if (a->used == 0) {
return 0;
} else if (a->used == 1) {
return 1;
} else if (a->used > 1) {
iy = mp_count_bits(a);
2003-12-24 18:59:22 +00:00
iz = 1;
iw = 1;
/* Test every bit from the second digit up, must be 1 */
2003-08-05 01:24:44 +00:00
for (ix = DIGIT_BIT; ix < iy; ix++) {
2003-12-24 18:59:22 +00:00
if ((a->dp[iw] & iz) == 0) {
2003-08-05 01:24:44 +00:00
return 0;
}
2003-12-24 18:59:22 +00:00
iz <<= 1;
if (iz > (int)MP_MASK) {
++iw;
iz = 1;
}
2003-08-05 01:24:44 +00:00
}
}
return 1;
}