Re:Flaw found in online encryption method
by jalapeno_dude on Tuesday February 14, 2012 @03:37PM
(#3591702)
They didn't describe the technique, but the fact that the paper has the keyword "Euclidean algorithm" makes it pretty obvious--they just gathered a list of public keys, took the gcd of all the pairs, and whenever they found a gcd not equal to one, they'd cracked both keys out of that particular pair. See my earlier comment.
[ Parent
| on HN ]
I took the 'the straightforward approach would require
about ten core-years and would not scale well' to mean they had a more efficient method.
Re:Flaw found in online encryption method
by tptacek on Tuesday February 14, 2012 @05:46PM
(#3592152)
They do, but does it matter? Ten core-years is not a forbidding threshold.
Not really - it does make a difference between amateur attackers and professional, but the potential value is high enough that there will probably be plenty of well funded attackers.