From ead935588285b49aae904f132df5071d44b8b7c4 Mon Sep 17 00:00:00 2001 From: Simon Tatham Date: Mon, 2 Mar 2020 18:51:39 +0000 Subject: [PATCH] Fix comment in old probabilistic prime algorithm. We're no longer doing the delta step at all, and even if we were, it's not really part of _that_ particular algorithm - candidate selection is centralised between all of them. --- sshprime.c | 8 ++------ 1 file changed, 2 insertions(+), 6 deletions(-) diff --git a/sshprime.c b/sshprime.c index 4ed3eb1d..1900de0d 100644 --- a/sshprime.c +++ b/sshprime.c @@ -13,12 +13,8 @@ /* ---------------------------------------------------------------------- * Standard probabilistic prime-generation algorithm: * - * - invent a B-bit random number and ensure the top and bottom - * bits are set (so it's definitely B-bit, and it's definitely - * odd) - * - * - see if it's coprime to all primes below 2^16; increment it by - * two until it is (this shouldn't take long in general) + * - get a number from our PrimeCandidateSource which will at least + * avoid being divisible by any prime under 2^16 * * - perform the Miller-Rabin primality test enough times to * ensure the probability of it being composite is 2^-80 or