Advertisement

Prime Numbers pp 227-283 | Cite as

Subexponential Factoring Algorithms

  • Richard Crandall
  • Carl Pomerance

Abstract

The methods of this chapter include two of the three basic workhorses of modern factoring, the quadratic sieve (QS) and the number field sieve (NFS). (The third workhorse, the elliptic curve method (ECM), is described in Chapter 7.) The quadratic sieve and number field sieve are direct descendants of the continued fraction factoring method of Brillhart and Morrison, which was the first subexponential factoring algorithm on the scene. The continued fraction factoring method, which was introduced in the early 1970s, allowed complete factorizations of numbers of around 50 digits, when previously, about 20 digits had been the limit. The quadratic sieve and the number field sieve, each with its strengths and domain of excellence, have pushed our capability for complete factorization from 50 digits to now over 150 digits for the size of numbers to be routinely factored. By contrast, the elliptic curve method has allowed the discovery of prime factors up to 50 digits and beyond, with fortunately weak dependence on the size of number to be factored. We include in this chapter a small discussion of rigorous factorization methods that in their own way also represent the state of the art. We also discuss briefly some subexponential discrete logarithm algorithms for the multiplicative groups of finite fields.

Keywords

Prime Ideal Algebraic Integer Free Relation Gaussian Integer Nontrivial Factorization 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag, New York, Inc. 2001

Authors and Affiliations

  • Richard Crandall
    • 1
  • Carl Pomerance
    • 2
  1. 1.Center for Advanced ComputationPortlandUSA
  2. 2.Department of MathematicsDartmouth UniversityHanoverUSA

Personalised recommendations