HELP! * GREY=local LOCAL HTML version of Foils prepared December 3,95

Foil 7 How hard is Factoring the Public Modulus?

From Webwork and its application to Factoring on the Web Supercomputing 95 -- December 3-8,95. by Jim Cowie, Geoffrey Fox, Wojtek Furmanski * See also color IMAGE

Rivest, Shamir and Adleman (RSA!) posed RSA-129 in August 1977 Scientific American, predicting 40 quadrillion years as a solution time
Actual time to crack RSA-129 was about eight months on the Internet (April 1994)
  • A nice illustration of importance of algorithm improvements as well as VLSI based compute performance improvements!
Still, many sites still use keys as small as 512 bits long (155 decimal digits) to protect enormous amounts of code and data
Using the latest factoring technology it will only take a few tera-op months to factor a 512 binary bit number!



Northeast Parallel Architectures Center, Syracuse University, npac@npac.syr.edu

If you have any comments about this server, send e-mail to webmaster@npac.syr.edu.

Page produced by wwwfoil on Mon Feb 17 1997