MPQS with three large primes
Author
P. Leyland, A.K. Lenstra, B. Dodson, A. Muffet and S.S. Wagstaff Jr.
Abstract
We report the factorization of a 135-digit integer by the three large prime variation of the multiple polynomial quadratic sieve, the largest
factorization ever performed with MPQS.
We show that it is worthwhile to use
three large primes, contrary to previous
work.
Journal
Algorithmic Number Theory
Publisher
Springer-Verlag
Series
Proceedings ANTS 2002, Lecture Notes in Computer Science
Affiliation
Microsoft, Citibank, Lehigh Univ., Sun Mocrosystems, CERIAS
Publication Date
2002-01-01
Subject
The multiple polynomial quadratic sievewith three large primes