libtommath/mp_reduce_is_2k_l.c

28 lines
660 B
C
Raw Normal View History

#include "tommath_private.h"
#ifdef MP_REDUCE_IS_2K_L_C
2019-04-07 13:29:11 +00:00
/* LibTomMath, multiple-precision integer library -- Tom St Denis */
/* SPDX-License-Identifier: Unlicense */
2005-02-12 08:40:15 +00:00
/* determines if reduce_2k_l can be used */
bool mp_reduce_is_2k_l(const mp_int *a)
2005-02-12 08:40:15 +00:00
{
if (mp_iszero(a)) {
return false;
2005-02-12 08:40:15 +00:00
} else if (a->used == 1) {
return true;
2005-02-12 08:40:15 +00:00
} else if (a->used > 1) {
/* if more than half of the digits are -1 we're sold */
2019-10-29 17:41:25 +00:00
int ix, iy;
2005-02-12 08:40:15 +00:00
for (iy = ix = 0; ix < a->used; ix++) {
2019-05-07 19:30:27 +00:00
if (a->dp[ix] == MP_DIGIT_MAX) {
2017-08-30 17:13:53 +00:00
++iy;
}
2005-02-12 08:40:15 +00:00
}
return (iy >= (a->used/2));
2019-05-14 16:49:27 +00:00
} else {
return false;
2005-02-12 08:40:15 +00:00
}
}
#endif