diff options
| author | Niels Möller <nisse@lysator.liu.se> | 2014-03-28 18:38:02 +0100 |
|---|---|---|
| committer | Niels Möller <nisse@lysator.liu.se> | 2014-03-28 18:38:02 +0100 |
| commit | ea94f78d28df9776c0d934c96331784f445d0cd9 (patch) | |
| tree | 74ed78617aaa0d33b91e9d5b73662a119cd4a203 /bignum-random-prime.c | |
| parent | 4f80d1d2b8cdd09cf910533c21b0d250c6d235dc (diff) | |
| download | nettle-ea94f78d28df9776c0d934c96331784f445d0cd9.tar.gz | |
Comment improvement.
Diffstat (limited to 'bignum-random-prime.c')
| -rw-r--r-- | bignum-random-prime.c | 5 |
1 files changed, 3 insertions, 2 deletions
diff --git a/bignum-random-prime.c b/bignum-random-prime.c index c0cf4b22..26812b9f 100644 --- a/bignum-random-prime.c +++ b/bignum-random-prime.c @@ -315,8 +315,9 @@ miller_rabin_pocklington(mpz_t n, mpz_t nm1, mpz_t nm1dq, mpz_t a) /* Generate a prime number p of size bits with 2 p0q dividing (p-1). p0 must be of size >= ceil(bits/3). The extra factor q can be - omitted. If top_bits_set is one, the topmost two bits are set to - one, suitable for RSA primes. Also returns r = (p-1)/q. */ + omitted (then p0 and p0q should be equal). If top_bits_set is one, + the topmost two bits are set to one, suitable for RSA primes. Also + returns r = (p-1)/p0q. */ void _nettle_generate_pocklington_prime (mpz_t p, mpz_t r, unsigned bits, int top_bits_set, |