Lines Matching defs:bits
22 static int probable_prime(BIGNUM *rnd, int bits, int safe, prime_t *mods,
24 static int probable_prime_dh(BIGNUM *rnd, int bits, int safe, prime_t *mods,
74 static int calc_trial_divisions(int bits)
76 if (bits <= 512)
78 else if (bits <= 1024)
80 else if (bits <= 2048)
82 else if (bits <= 4096)
94 static int bn_mr_min_checks(int bits)
96 if (bits > 2048)
123 int BN_generate_prime_ex2(BIGNUM *ret, int bits, int safe,
131 int checks = bn_mr_min_checks(bits);
133 if (bits < 2) {
137 } else if (add == NULL && safe && bits < 6 && bits != 3) {
139 * The smallest safe prime (7) is three bits.
140 * But the following two safe primes with less than 6 bits (11, 23)
158 /* make a random number and set the top and bottom bits */
160 if (!probable_prime(ret, bits, safe, mods, ctx))
163 if (!probable_prime_dh(ret, bits, safe, mods, add, rem, ctx))
213 int BN_generate_prime_ex(BIGNUM *ret, int bits, int safe,
222 retval = BN_generate_prime_ex2(ret, bits, safe, add, rem, cb, ctx);
389 /* (Step 4.1) obtain a Random string of bits b where 1 < b < w-1 */
470 * Generate a random number of |bits| bits that is probably prime by sieving.
478 static int probable_prime(BIGNUM *rnd, int bits, int safe, prime_t *mods,
483 int trial_divisions = calc_trial_divisions(bits);
487 if (!BN_priv_rand_ex(rnd, bits, BN_RAND_TOP_TWO, BN_RAND_BOTTOM_ODD, 0,
509 if (bits <= 31 && delta <= 0x7fffffff
522 if (BN_num_bits(rnd) != bits)
529 * Generate a random number |rnd| of |bits| bits that is probably prime
536 static int probable_prime_dh(BIGNUM *rnd, int bits, int safe, prime_t *mods,
543 int trial_divisions = calc_trial_divisions(bits);
554 if (!BN_rand_ex(rnd, bits, BN_RAND_TOP_ONE, BN_RAND_BOTTOM_ODD, 0, ctx))
571 if (BN_num_bits(rnd) < bits
588 if (bits <= 31 && delta <= 0x7fffffff