From 65d7ad4e73817147cc4b5d2f6a5cb962cdfaf75a Mon Sep 17 00:00:00 2001 From: Piotr Dyraga Date: Fri, 27 Jul 2018 17:43:46 +0200 Subject: [PATCH] Fixed typo in the documentation --- safe_prime_generator.go | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/safe_prime_generator.go b/safe_prime_generator.go index 7e87275..ea677eb 100644 --- a/safe_prime_generator.go +++ b/safe_prime_generator.go @@ -145,7 +145,7 @@ type safePrime struct { // If `p` is coprime to all the elements of `smallPrimes`, go to point 5. // 5. At this point, we know `q` is potentially prime, and `p=q+1` is also // potentially prime. We need to execute a final primality test for `q`. -// We apply Miller-Rabin and Baillie-PSW tests. If they succeeds, it means +// We apply Miller-Rabin and Baillie-PSW tests. If they succeed, it means // that `q` is prime with a very high probability. Knowing `q` is prime, // we use Pocklington's criterion to prove the primality of `p=2q+1`, that // is, we execute Fermat primality test to base 2 checking whether