Factoring Breakthrough? 492
An anonymous reader sent in: "In this post to the Cryptography Mailing List, someone who knows more about math than I do claimed "effectively all PGP RSA keys shorter than 2k bits are insecure, and the 2kbit keys are not nearly as secure as we thought they were." Apparently Dan Bernstein of qmail fame figured out how to factor integers faster on the same cost hardware. Should we be revoking our keys and creating larger ones? Is this "the biggest
news in crypto in the last decade," as the original poster claims, or only ginger-scale big?"
Re:Ginger scale big? (Score:2, Funny)
it is from DJB (Score:1, Funny)
Whew - I'm safe (Score:3, Funny)
Re:Were they even secure yesterday? (Score:2, Funny)
Especially if you misspell everything!
Re:Really Unique Crypto (Score:2, Funny)
And all of these, really, are just techniques that split up the message, and then assume the decrypters can only get one part. So essentially you could do this with any encryption algorithm, just send part by the internet, and part by carrier pigeon, attack stoat, etc.
Reward (Score:5, Funny)
Re:OT: Your sig (Score:3, Funny)
I don't care about n-bit encryption (Score:5, Funny)
Re:Just wait... (Score:5, Funny)
Re:Were they even secure yesterday? (Score:2, Funny)
From the government?
Forget encryption. Piss them off and they'll come after you directly.
Re:Ginger scale big? (Score:2, Funny)
I was always partial to the maryann scale, myself.
Re:Hmm.... (Score:4, Funny)
to be secure
Good, because here's a script I wrote that factors any prime number in constant time:
#/usr/local/bin/perl5 -w
print "Please enter a prime number";
chomp($prime = <STDIN>)
print "The factors of $prime are $prime and 1";
exit(0);
Of course, you really DO need to input a prime for it to work.
Re:This does /not/ break RSA. (Score:3, Funny)