libtommath/bn_mp_reduce_is_2k_l.c

43 lines
1.1 KiB
C
Raw Normal View History

#include <tommath_private.h>
2005-02-12 08:40:15 +00:00
#ifdef BN_MP_REDUCE_IS_2K_L_C
/* 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.
*/
/* determines if reduce_2k_l can be used */
2017-09-20 14:59:43 +00:00
int mp_reduce_is_2k_l(const mp_int *a)
2005-02-12 08:40:15 +00:00
{
int ix, iy;
2017-08-30 03:51:11 +00:00
2005-02-12 08:40:15 +00:00
if (a->used == 0) {
return MP_NO;
} else if (a->used == 1) {
return MP_YES;
} else if (a->used > 1) {
/* if more than half of the digits are -1 we're sold */
for (iy = ix = 0; ix < a->used; ix++) {
2017-08-30 17:13:53 +00:00
if (a->dp[ix] == MP_MASK) {
++iy;
}
2005-02-12 08:40:15 +00:00
}
return (iy >= (a->used/2)) ? MP_YES : MP_NO;
2017-08-30 03:51:11 +00:00
2005-02-12 08:40:15 +00:00
}
return MP_NO;
}
#endif
2005-08-01 16:37:28 +00:00
2017-08-28 14:27:26 +00:00
/* ref: $Format:%D$ */
/* git commit: $Format:%H$ */
/* commit time: $Format:%ai$ */