The Multiple Polynomial Quadratic Sieve

@inproceedings{Silverman2010TheMP,
  title={The Multiple Polynomial Quadratic Sieve},
  author={Robert D. Silverman},
  year={2010}
}
A modification, due to Peter Montgomery, of Pomerance's Quadratic Sieve for factoring large integers is discussed along with its implementation. Using it, allows factorization with over an order of magnitude less sieving than the basic algorithm. It enables one to factor numbers in the 60-digit range in about a day, using a large minicomputer. The algorithm has features which make it well adapted to parallel implementation. 
Highly Cited
This paper has 42 citations. REVIEW CITATIONS