Lines Matching refs:primes
16 * The quick sieve algorithm approach to weeding out primes is Philip
40 * The product of the set of primes ranging from 3 to 751
140 * But the following two safe primes with less than 6 bits (11, 23)
297 BN_ULONG mod = BN_mod_word(w, primes[i]);
301 return BN_is_word(w, primes[i]);
484 BN_ULONG maxdelta = BN_MASK2 - primes[trial_divisions - 1];
494 BN_ULONG mod = BN_mod_word(rnd, (BN_ULONG)primes[i]);
504 * gcd(rnd-1,primes) == 1 (except for 2)
505 * do the second check only if we are interested in safe primes
507 * we check only the primes up to sqrt(rnd)
510 && square(primes[i]) > BN_get_word(rnd) + delta)
512 if (safe ? (mods[i] + delta) % primes[i] <= 1
513 : (mods[i] + delta) % primes[i] == 0) {
544 BN_ULONG maxdelta = BN_MASK2 - primes[trial_divisions - 1];
579 BN_ULONG mod = BN_mod_word(rnd, (BN_ULONG)primes[i]);
589 && square(primes[i]) > BN_get_word(rnd) + delta)
592 if (safe ? (mods[i] + delta) % primes[i] <= 1
593 : (mods[i] + delta) % primes[i] == 0) {