From 675153a53dc8d020ea6e00dcce908982c9ea2eef Mon Sep 17 00:00:00 2001 From: Niklas Date: Sun, 5 Jun 2022 19:17:54 +0200 Subject: [PATCH] README: add new line to not have a headline where it is not supposed to be --- README.md | 1 + 1 file changed, 1 insertion(+) diff --git a/README.md b/README.md index c1d024e..52d8f04 100644 --- a/README.md +++ b/README.md @@ -24,6 +24,7 @@ In each iteration increase `a` by 1 until a solution is found or the amount of t In the iteration itself calculate `b^2 = a^2 - N` then check if `b` is non-negative and a square number. If so the solution is found. If not then increase `a` by 1 and try again. + --- **This method to calculate `p1` and `p2` for RSA-keys is a good method if the two prime numbers are close together. However, if they are not close it takes long.