Go to the source code of this file.
|
int | BN_enhanced_miller_rabin_primality_test (enum bn_primality_result_t *out_result, const BIGNUM *w, int checks, BN_CTX *ctx, BN_GENCB *cb) |
|
int | BN_GENCB_call (BN_GENCB *callback, int event, int n) |
|
void | BN_GENCB_set (BN_GENCB *callback, int(*f)(int event, int n, struct bn_gencb_st *), void *arg) |
|
int | BN_generate_prime_ex (BIGNUM *ret, int bits, int safe, const BIGNUM *add, const BIGNUM *rem, BN_GENCB *cb) |
|
int | BN_is_prime_ex (const BIGNUM *candidate, int checks, BN_CTX *ctx, BN_GENCB *cb) |
|
int | BN_is_prime_fasttest_ex (const BIGNUM *a, int checks, BN_CTX *ctx, int do_trial_division, BN_GENCB *cb) |
|
int | bn_miller_rabin_init (BN_MILLER_RABIN *miller_rabin, const BN_MONT_CTX *mont, BN_CTX *ctx) |
|
int | bn_miller_rabin_iteration (const BN_MILLER_RABIN *miller_rabin, int *out_is_possibly_prime, const BIGNUM *b, const BN_MONT_CTX *mont, BN_CTX *ctx) |
|
int | bn_odd_number_is_obviously_composite (const BIGNUM *bn) |
|
int | BN_primality_test (int *out_is_probably_prime, const BIGNUM *w, int checks, BN_CTX *ctx, int do_trial_division, BN_GENCB *cb) |
|
static int | BN_prime_checks_for_size (int bits) |
|
static int | bn_trial_division (uint16_t *out, const BIGNUM *bn) |
|
static size_t | num_trial_division_primes (const BIGNUM *n) |
|
static int | probable_prime (BIGNUM *rnd, int bits) |
|
static int | probable_prime_dh (BIGNUM *rnd, int bits, const BIGNUM *add, const BIGNUM *rem, BN_CTX *ctx) |
|
static int | probable_prime_dh_safe (BIGNUM *rnd, int bits, const BIGNUM *add, const BIGNUM *rem, BN_CTX *ctx) |
|
◆ BN_PRIME_CHECKS_BLINDED
#define BN_PRIME_CHECKS_BLINDED 16 |
◆ BN_enhanced_miller_rabin_primality_test()
◆ BN_GENCB_call()
◆ BN_GENCB_set()
◆ BN_generate_prime_ex()
◆ BN_is_prime_ex()
◆ BN_is_prime_fasttest_ex()
◆ bn_miller_rabin_init()
◆ bn_miller_rabin_iteration()
◆ bn_odd_number_is_obviously_composite()
◆ BN_primality_test()
◆ BN_prime_checks_for_size()
static int BN_prime_checks_for_size |
( |
int |
bits | ) |
|
|
static |
◆ bn_trial_division()
◆ num_trial_division_primes()
static size_t num_trial_division_primes |
( |
const BIGNUM * |
n | ) |
|
|
static |
◆ probable_prime()
◆ probable_prime_dh()
◆ probable_prime_dh_safe()
◆ kPrimes