New Elliptic Curve Cryptography Record 43
deian writes "Cryptography researchers Joppe W. Bos, Marcelo E. Kaihara, Thorsten Kleinjung, Arjen K. Lenstra and Peter L. Montgomery have just announced that they have set a new record for the elliptic curve discrete logarithm problem (ECDLP) by solving it over a 112-bit finite field. The previous record was for a 109-bit prime field and dates back from October 2002. Their calculation was done on the EPFL cluster of more than 200 PS3s (same one used to create the Rogue CA certificates and demonstrate a reproducible attack on MD5 algorithms). On the PS3, the effort is equivalent to about 14 full 56-bit DES key searches!"
Re:For those who aren't number theorists... (Score:5, Funny)
And this means what?
Anyone else suspicious (Score:5, Funny)
Okay so they've done some cool stuff with their 200 PS3s.... but does anyone else get the feeling that they are mainly just having massive LAN parties and they just doing some research whenever the Dean asks where the money has gone.
Oh hang on, they are pure mathematicians... this sort of stuff is their equivalent of a LAN party.
Re:Cuda? (Score:4, Funny)
That's nothing. The Wii version will crunch those numbers as fast as you can wave your arms.
Re:Anyone else suspicious (Score:4, Funny)
Nope, these guys are a bunch of applied crypto geeks / coders. A pure mathematician isn't the least bit interested in how fast you can get your brute force crypto code to run on a PS3.
And pure mathematician LAN parties use blackboards.
Re:Cuda? (Score:2, Funny)