Dan Bernstein’s Claim on RSA Key Factorisation
Read a story on the Slashdot today claiming Dan Bernstein of cr.yp.to has found a way to improve factoring speed in the RSA key discovery. The conclusion? RSA keys under 2k bits become less secure as they were before. If it is true (and the algorithm works), it is definitely going to be the biggest cryptography news of the last few years, and it will have huge impact on the digital security of this world.
Update: According to Bruce Schneier in his Crypto-Gram newsletter, Dan Bernstein’s discover of factorisation optimisation is not going to produce a big impact. Well… (16 March 2002)
Add a comment
Gravatar is used. Email address is required but will not be displayed. Please keep your comment on topic. No spamming and/or bad language. First time poster will be moderated. Scott reserves the right to delete/edit your comments.
Playground is the personal weblog of Scott Yang, a Chinese-Australian Christian who works as a software developer in Sydney Australia.