blob: 63b2405ab3d6d874320925757466c1d91474ea95 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
|
#include "tommath_private.h"
#ifdef S_MP_PRIME_IS_DIVISIBLE_C
/* LibTomMath, multiple-precision integer library -- Tom St Denis */
/* SPDX-License-Identifier: Unlicense */
/* determines if an integers is divisible by one
* of the first PRIME_SIZE primes or not
*
* sets result to 0 if not, 1 if yes
*/
mp_err s_mp_prime_is_divisible(const mp_int *a, bool *result)
{
int i;
for (i = 0; i < MP_PRIME_TAB_SIZE; i++) {
/* what is a mod LBL_prime_tab[i] */
mp_err err;
mp_digit res;
if ((err = mp_mod_d(a, s_mp_prime_tab[i], &res)) != MP_OKAY) {
return err;
}
/* is the residue zero? */
if (res == 0u) {
*result = true;
return MP_OKAY;
}
}
/* default to not */
*result = false;
return MP_OKAY;
}
#endif
|
