Lines Matching defs:rnd
134 static int probable_prime(BIGNUM *rnd, int bits);
135 static int probable_prime_dh(BIGNUM *rnd, int bits,
138 static int probable_prime_dh_safe(BIGNUM *rnd, int bits, const BIGNUM *add,
378 static int probable_prime(BIGNUM *rnd, int bits)
385 if (!BN_rand(rnd, bits, 1, 1))
389 mods[i] = (prime_t) BN_mod_word(rnd, (BN_ULONG)primes[i]);
394 * check that rnd is not a prime and also that gcd(rnd-1,primes) == 1
404 if (!BN_add_word(rnd, delta))
406 bn_check_top(rnd);
410 static int probable_prime_dh(BIGNUM *rnd, int bits,
421 if (!BN_rand(rnd, bits, 0, 1))
424 /* we need ((rnd-rem) % add) == 0 */
426 if (!BN_mod(t1, rnd, add, ctx))
428 if (!BN_sub(rnd, rnd, t1))
431 if (!BN_add_word(rnd, 1))
434 if (!BN_add(rnd, rnd, rem))
441 /* check that rnd is a prime */
442 if (BN_mod_word(rnd, (BN_ULONG)primes[i]) <= 1) {
443 if (!BN_add(rnd, rnd, add))
451 bn_check_top(rnd);
475 /* we need ((rnd-rem) % add) == 0 */