New Elliptic Curve Cryptography Record 43
Posted
by
Soulskill
from the feistel-would-be-impressed dept.
from the feistel-would-be-impressed dept.
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!"
New Elliptic Curve Cryptography Record More Login
New Elliptic Curve Cryptography Record
Related Links Top of the: day, week, month.