[144441] in cryptography@c2.net mail archive
Significance of Schnorr's "Factoring Integers in Polynomial Time"?
daemon@ATHENA.MIT.EDU (Francois Grieu)
Sun May 10 12:19:27 2009
Date: Sun, 10 May 2009 15:29:50 +0200
From: Francois Grieu <fgrieu@gmail.com>
To: cryptography@metzdowd.com
At the rump session of Eurocrypt 2009,
http://eurocrypt2009rump.cr.yp.to/
Claus P. Schnorr reportedly presented slides titled "Average Time Fast
SVP and CVP Algorithms: Factoring Integers in Polynomial Time"
http://eurocrypt2009rump.cr.yp.to/e074d37e10ad1ad227200ea7ba36cf73.pdf
I hardly understand 1/4 of the mathematical notation used, and can't
even be sure that the thing is not a (very well done) prank.
Anyone one the list dare make a comment / risk an opinion?
Francois Grieu
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@metzdowd.com
