aboutsummaryrefslogtreecommitdiff
path: root/primes.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'primes.cpp')
-rw-r--r--primes.cpp2
1 files changed, 1 insertions, 1 deletions
diff --git a/primes.cpp b/primes.cpp
index 0bda8f6..07933d5 100644
--- a/primes.cpp
+++ b/primes.cpp
@@ -34,7 +34,7 @@ pair<Bigint,Bigint> genprimepair(Rng &rng,int nbits){
// (2^x + 2^(x-2))^2 = 2^(2x) + 2^(2x-1) + 2^(2x-4)
// ergo: (2^x + lambda*2^(x-2))^2 \in [2^(2x), 2^(2x+1)), for lambda \in [0,1]
// To make sure the primes "differ in length by a few digits" [RSA78], we use x1=x-2 in the first
- // prime and x2-x+2 in the second
+ // prime and x2=x+2 in the second random prime searched
int x1=nbits/2-2,x2=(nbits+1)/2+2;
assert(x1+x2==nbits);
return make_pair(