tommath/bn_mp_prime_is_divisible.c

49 lines
1.2 KiB
C
Raw Normal View History

#include <tommath_private.h>
2004-10-29 18:07:18 -04:00
#ifdef BN_MP_PRIME_IS_DIVISIBLE_C
2003-03-22 10:10:20 -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-03-22 10:10:20 -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-03-22 10:10:20 -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.
*/
2017-08-29 23:51:11 -04:00
/* determines if an integers is divisible by one
2003-07-02 11:39:39 -04:00
* of the first PRIME_SIZE primes or not
2003-03-22 10:10:20 -05:00
*
* sets result to 0 if not, 1 if yes
*/
2017-09-20 10:59:43 -04:00
int mp_prime_is_divisible(const mp_int *a, int *result)
2003-03-22 10:10:20 -05:00
{
2017-08-30 13:13:53 -04:00
int err, ix;
mp_digit res;
2003-03-22 10:10:20 -05:00
2017-08-30 13:13:53 -04:00
/* default to not */
*result = MP_NO;
2003-03-22 10:10:20 -05:00
2017-08-30 13:13:53 -04:00
for (ix = 0; ix < PRIME_SIZE; ix++) {
/* what is a mod LBL_prime_tab[ix] */
if ((err = mp_mod_d(a, ltm_prime_tab[ix], &res)) != MP_OKAY) {
return err;
}
2003-03-22 10:10:20 -05:00
2017-08-30 13:13:53 -04:00
/* is the residue zero? */
2017-10-15 13:57:12 -04:00
if (res == 0u) {
2017-08-30 13:13:53 -04:00
*result = MP_YES;
return MP_OKAY;
}
}
2003-03-22 10:10:20 -05:00
2017-08-30 13:13:53 -04:00
return MP_OKAY;
2003-03-22 10:10:20 -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$ */