Lines Matching refs:primes
125 * The quick sieve algorithm approach to weeding out primes is Philip
269 if (BN_mod_word(a, primes[i]) == 0)
389 mods[i] = (prime_t) BN_mod_word(rnd, (BN_ULONG)primes[i]);
390 maxdelta = BN_MASK2 - primes[NUMPRIMES - 1];
394 * check that rnd is not a prime and also that gcd(rnd-1,primes) == 1
397 if (((mods[i] + delta) % primes[i]) <= 1) {
442 if (BN_mod_word(rnd, (BN_ULONG)primes[i]) <= 1) {
499 * check that for p and q gcd(p-1,primes) == 1 (except for 2)
501 if ((BN_mod_word(p, (BN_ULONG)primes[i]) == 0) ||
502 (BN_mod_word(q, (BN_ULONG)primes[i]) == 0)) {