Loading doc/crypto/BN_generate_prime.pod +5 −4 Original line number Diff line number Diff line Loading @@ -14,8 +14,9 @@ BN_generate_prime, BN_is_prime, BN_is_prime_fasttest - Generate primes and test int BN_is_prime(BIGNUM *a, int checks, void (*callback)(int, int, void *), BN_CTX *ctx, void *cb_arg); int BN_is_prime_fasttest(BIGNUM *a, int checks, void (*callback)(int, int, void *), BN_CTX *ctx, BN_CTX *ctx2, void *cb_arg, int do_trial_division); int BN_is_prime_fasttest(BIGNUM *a, int checks, void (*callback)(int, int, void *), BN_CTX *ctx, BN_CTX *ctx2, void *cb_arg, int do_trial_division); =head1 DESCRIPTION Loading Loading @@ -56,7 +57,7 @@ that (p-1)/2 is also prime). The PRNG must be seeded prior to calling BN_generate_prime(). The prime number generation has a negligible error probability. BN_is_prime() and BN_is_prime_fasttest test if the number B<a> is BN_is_prime() and BN_is_prime_fasttest() test if the number B<a> is prime. The following tests are performed until one of them shows that B<a> is composite; if B<a> passes all these tests, it is considered prime. Loading @@ -83,7 +84,7 @@ after the j-th iteration (j = 0, 1, ...). B<ctx> is a pre-allocated B<BN_CTX> (to save the overhead of allocating and freeing the structure in a loop), or B<NULL>. For BN_is_prime_fasttest(), B<ctx2> is a second pre-allocated B<BN_CTX> or B<NULL> (lacking this parameter, BN_is_prime() always has to allocated B<NULL> (lacking this parameter, BN_is_prime() always has to allocate an additional B<CN_CTX>). Loading doc/crypto/DSA_generate_parameters.pod +1 −1 File changed.Contains only whitespace changes. Show changes Loading
doc/crypto/BN_generate_prime.pod +5 −4 Original line number Diff line number Diff line Loading @@ -14,8 +14,9 @@ BN_generate_prime, BN_is_prime, BN_is_prime_fasttest - Generate primes and test int BN_is_prime(BIGNUM *a, int checks, void (*callback)(int, int, void *), BN_CTX *ctx, void *cb_arg); int BN_is_prime_fasttest(BIGNUM *a, int checks, void (*callback)(int, int, void *), BN_CTX *ctx, BN_CTX *ctx2, void *cb_arg, int do_trial_division); int BN_is_prime_fasttest(BIGNUM *a, int checks, void (*callback)(int, int, void *), BN_CTX *ctx, BN_CTX *ctx2, void *cb_arg, int do_trial_division); =head1 DESCRIPTION Loading Loading @@ -56,7 +57,7 @@ that (p-1)/2 is also prime). The PRNG must be seeded prior to calling BN_generate_prime(). The prime number generation has a negligible error probability. BN_is_prime() and BN_is_prime_fasttest test if the number B<a> is BN_is_prime() and BN_is_prime_fasttest() test if the number B<a> is prime. The following tests are performed until one of them shows that B<a> is composite; if B<a> passes all these tests, it is considered prime. Loading @@ -83,7 +84,7 @@ after the j-th iteration (j = 0, 1, ...). B<ctx> is a pre-allocated B<BN_CTX> (to save the overhead of allocating and freeing the structure in a loop), or B<NULL>. For BN_is_prime_fasttest(), B<ctx2> is a second pre-allocated B<BN_CTX> or B<NULL> (lacking this parameter, BN_is_prime() always has to allocated B<NULL> (lacking this parameter, BN_is_prime() always has to allocate an additional B<CN_CTX>). Loading
doc/crypto/DSA_generate_parameters.pod +1 −1 File changed.Contains only whitespace changes. Show changes