3 ms·
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 publ
by jalapeno_dude 15y ago
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.
- nohat 15y agoI took the 'the straightforward approach would require about ten core-years and would not scale well' to mean they had a more efficient method.