Re:Researcher uses 379-year-old algorithm to crack crypto ke...
by anthk on Wednesday March 23, 2022 @11:04AM
(#30779200)
(2^8)+1 and (2^16)+1, for example. Pretty easy to compute, and hack too :).
[ Parent
| on HN ]
Re:Researcher uses 379-year-old algorithm to crack crypto ke...
by ColinWright on Wednesday March 23, 2022 @11:13AM
(#30779289)
Yes, broadly you want p and q to differ in length by a few digits (so one is tens or hundreds of thousands bigger than the other), and you want p-1 and q-1 both to have at least one large factor. So the example you give here fails on the second of those, since both p-1 and q-1 are comprised only of small factors.
And they're not very big <grin>