X-Git-Url: https://git.librecmc.org/?a=blobdiff_plain;f=doc%2Fcrypto%2FBN_generate_prime.pod;h=7dccacbc1e553f6cf47cbfe4ce1eb9b8eea7404c;hb=ec14c80c7cd4949af0b2d85e4bd2952d22c1707f;hp=ab84d3fcfccddea754174db77a2e87d0d379a4e8;hpb=e74231ed9e5b7a95fd7af625a09628d69eac76c3;p=oweals%2Fopenssl.git diff --git a/doc/crypto/BN_generate_prime.pod b/doc/crypto/BN_generate_prime.pod index ab84d3fcfc..7dccacbc1e 100644 --- a/doc/crypto/BN_generate_prime.pod +++ b/doc/crypto/BN_generate_prime.pod @@ -2,7 +2,7 @@ =head1 NAME -BN_generate_prime, BN_is_prime, BN_is_prime_fasttest - Generate primes and test for primality +BN_generate_prime, BN_is_prime, BN_is_prime_fasttest - generate primes and test for primality =head1 SYNOPSIS @@ -11,11 +11,12 @@ BN_generate_prime, BN_is_prime, BN_is_prime_fasttest - Generate primes and test BIGNUM *BN_generate_prime(BIGNUM *ret, int num, int safe, BIGNUM *add, BIGNUM *rem, void (*callback)(int, int, void *), void *cb_arg); - int BN_is_prime(BIGNUM *a, int checks, void (*callback)(int, int, + int BN_is_prime(const 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, void *cb_arg, int do_trial_division); + int BN_is_prime_fasttest(const BIGNUM *a, int checks, + void (*callback)(int, int, void *), BN_CTX *ctx, void *cb_arg, + int do_trial_division); =head1 DESCRIPTION @@ -69,7 +70,7 @@ If B, this test is skipped. Both BN_is_prime() and BN_is_prime_fasttest() perform a Miller-Rabin probabilistic primality test with B iterations. If -B, a number of iterations is used that +B, a number of iterations is used that yields a false positive rate of at most 2^-80 for random input. If B is not B, B is called @@ -89,7 +90,7 @@ The error codes can be obtained by L. =head1 SEE ALSO -L, L, L +L, L, L =head1 HISTORY