primes
primes(start, stop);
void primes(ubig, ubig);
if ((mod = BN_mod_word(n, primes[i])) == (BN_ULONG)-1)
*is_pseudoprime = BN_is_word(n, primes[i]);
BN_ULONG mod = BN_mod_word(rnd, primes[i]);
maxdelta = BN_MASK2 - primes[NUMPRIMES - 1];
if (((mods[i] + delta) % primes[i]) <= 1) {
BN_ULONG mod = BN_mod_word(rnd, primes[i]);
BN_ULONG pmod = BN_mod_word(p, primes[i]);
BN_ULONG qmod = BN_mod_word(q, primes[i]);
extern const uint16_t primes[NUMPRIMES];
const uint16_t primes[NUMPRIMES] = {
max = primes[NUMPRIMES - 1] + 1;
is_prime = i == primes[j];
unsigned primes[8] = { 2, 3, 5, 7, 11, 13, 17, 19 };
if (!BN_set_word(p, primes[i]))