Basic HTML version of Foils prepared May 12 1996

Foil 7 How hard is Factoring the Public Modulus?

From Lessons and Implementation -- RSA Factoring on the Web CRPC Annual Meeting -- May 14-17 1996. by Geoffrey Fox


1 Rivest, Shamir and Adleman (RSA!) posed RSA-129 in August 1977 Scientific American, predicting 40 quadrillion years as a solution time
2 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!
3 Still, many sites still use keys as small as 512 bits long (155 decimal digits) to protect enormous amounts of code and data
4 Using the latest factoring technology it will only take a few tera-op months to factor a 512 binary bit number!

in Table To:


© 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 Sun Dec 14 1997