wbrawner/openssl
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Typos.

Browse source
This commit is contained in:
Ulf Möller 2000-01-30 23:31:01 +00:00
parent 9d1a01be8f
commit 1749d8a039
2 changed files with 6 additions and 5 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

9
doc/crypto/BN_generate_prime.pod
View file

@ -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
@ -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.
@ -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>).

2
doc/crypto/DSA_generate_parameters.pod
View file

@ -62,7 +62,7 @@ B<callback(0, counter, cb_arg)> is called.
=item *
When a candidate for p has passed the test by trial division,
B<callback(1, -1 , cb_arg)> is called.
B<callback(1, -1, cb_arg)> is called.
While it is tested by the Miller-Rabin primality test,
B<callback(1, i, cb_arg)> is called in the outer loop
(once for each witness that confirms that the candidate may be prime).