From cmonico@nd.edu Thu Mar 18 15:18:28 1999
Date: Thu, 18 Mar 1999 15:06:06 -0500 (EST)
From: cmonico@nd.edu
To: cholak@nd.edu
Subject: 120-digit RSA modulus

It's from the RSA Labs Factoring Challenge


--------------------------------------------------------------------------
RSA-120
Factors: 327414555693498015751146303749141488063642403240171463406883 *
693342667110830181197325401899700641361965863127336680673013
Date: June 9, 1993
Method: ppmpqs
Time: 835 mips years
Name: Arjen K. Lenstra (45.503%), Bruce Dodson (30.271%),
      Thomas Denny (22.516%), Mark Manasse (1.658%),
      Walter Lioen and Herman te Riele (0.049%)
Email: lenstra@bellcore.com
Recd: June 9, 1993
---------------------------------------------------------------------------



In this size range, mpqs (multiple polynomial quadratic sieve) is probably
still the best method, and this time is roughly typical for the method.
In the HPCC looking only at the RS/6000, Origin 2000, and Model 390's we have,
there must be at least 5000 MIPS worth of speed. That would put the estimated
time (if those machines were dedicated to the task) at about 835/5000 years, or
roughly 2 months. The Generalized Number Field Sieve is asymptotically better,
and may be faster in that range- I really don't know.