Bernstein's NFS analyzed by Lenstra and Shamir

Posted by CmdrTaco on Tuesday June 4, 2002 @07:46AM from the my-c0de-is-s3kr37 dept.

kousik writes "The analysis of Bernstein's NFS by Arjen Lenstra, Adi Shamir, Jim Tomlinson, Eran Tromer has been put up on cryptosavvy. Seems interesting it comes from Lenstra and Shamir. Lenstra lead the 1994 factorisation of RSA 129. From the abstract: ... We also propose an improved circuit design based on a new mesh routing algorithm, and show that for factorization of 1024-bit integers the matrix step can, under an optimistic assumption about the matrix size, be completed within a day by a device that costs a few thousand dollars..."

2 of 168 comments (clear)

Min score:

Reason:

Sort:

hackers... by coronaride · 2002-06-04 07:51 · Score: 5, Funny

still waiting for that level of encryption shown in everyones favorite hacking movie that displays the giant skull and crossbones in a cheezy GUI to let you know that you don't have access..

--
Those who can, do. Those who can't, go into business for themselves.
Re:Cliff notes version by MAXOMENOS · 2002-06-04 08:31 · Score: 5, Funny

Bernstein will no doubt reply. He isn't a shy guy from my experience.

This post should be modded +4 Understated.

--
Finding God in a Dog