Computer Security Weekly, October 4, 1999Another decryption challenge has been broken. This time it was the 97-bit elliptic curve algorithm. Interestingly, the time taken to break the code was very roughly equivalent to that recently taken to crack the RSA 155 (512-bit) algorithm. This gives an indication that elliptic curve algorithms are a lot stronger than RSA and other prime based encryption. http://www.inria.fr/Actualites/pre55-eng... http://cristal.inria.fr/~harley/ecdl/ http://www.certicom.com/chal/ http://www.vet.com.au/html/vvcc/index.ht... http://www.microsoft.com/y2k/hoax/hoax2.... http://www.symantec.com/avcenter/venc/da...> mailto:rslade@sprint.ca mailto:robertslade@usa.net mailto:p1@canada.com
Mirrored at http://sun.soci.niu.edu/~rslade/rms.htm Linked to bookstore at http://www97.pair.com/robslade/
The copyright of the article Computer Security Weekly, October 4, 1999 in Computer Security is owned by Robert Slade. Permission to republish Computer Security Weekly, October 4, 1999 in print or online must be granted by the author in writing.
Go To Page: 1 Articles in this Topic Discussions in this Topic |