# let the flaming begin or Factoring Breakthrough?

**Ingo Klöcker
**
ingo.kloecker@epost.de

*Wed Feb 27 00:22:02 2002*

-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1
On Tuesday 26 February 2002 20:41, Douglas Calvert wrote:
>* Well there is a story on slashdot:
*>* http://slashdot.org/article.pl?sid=02/02/26/179206&mode=thread&tid==
*93
>* 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?"
*
I doubt it very much. Hundreds of cryptography experts all over the
world are at most making baby steps on improving factoring algorithms.
And now the author of qmail (is he a mathematician?) found out how to
factor integers faster? That's not very likely. Do you have a link
where Dan Bernstein describes his breakthrough?
Regards,
Ingo
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.0.6 (GNU/Linux)
Comment: For info see http://www.gnupg.org
iD8DBQE8fBQCGnR+RTDgudgRAm6xAJ0Y/c+1/s0SnzEZ8KJ2edepnxAN/gCfUz89
XVVmfGAS4p/heLMTpSGUNbA=
=xbV7
-----END PGP SIGNATURE-----