News for hackers. Stuff that matters.
Re:Researcher uses 379-year-old algorithm to crack crypto ke... by ColinWright on Saturday March 26, 2022 @01:34PM (#30813683)
While doing other rsearch I stumbled across this quotation from Wikipedia:

> The numbers p and q should not be "too close", lest the Fermat factorization for n be successful. If p − q is less than 2n^{1/4} (n = p⋅q, which even for "small" 1024-bit values of n is 3×10^{77}), solving for p and q is trivial. Furthermore, if either p − 1 or q − 1 has only small prime factors, n can be factored quickly by Pollard's p − 1 algorithm, and hence such values of p or q should be discarded.

Wikipedia is not always right, and certainly shouldn't be trusted implicitly on details in depth, but it's an interesting thing for them to be saying.

There are no comments on this comment yet.