From ea94f78d28df9776c0d934c96331784f445d0cd9 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Niels=20M=C3=B6ller?= <nisse@lysator.liu.se>
Date: Fri, 28 Mar 2014 18:38:02 +0100
Subject: [PATCH] Comment improvement.
---
bignum-random-prime.c | 5 +++--
1 file 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,
--
GitLab