Factoring a 135-digit Integer
The following group of people set a new record factoring a 135-digit integer with the multiple-polynomial quadratic sieve algorithm with three large primes last year. Purdue's IBM SP did a large part of the work.
- P. Leyland, Microsoft Research, Cambridge, UK.
- A. K. Lenstra, Citybank, New York City.
- B. Dodson, Lehigh University, Bethlehem, PA.
- A. Muffett, Sun Microsystems, Camberley, UK.
- S. S. Wagstaff, Jr., Purdue University CERIAS and Computer Science
They presented a paper titled "MPQS with three large primes" at the 2002 Algorithmic Number Theory Symposium, which was published in the ANTS 2002 Proceedings, volume 2369 of Springer-Verlag Lecture Notes in Computer Science, 2002, pages 448-462.