Factoring integers with the number field sieve

  • J. P. Buhler
  • H. W. LenstraJr.
  • Carl Pomerance
Conference paper

DOI: 10.1007/BFb0091539

Part of the Lecture Notes in Mathematics book series (LNM, volume 1554)
Cite this paper as:
Buhler J.P., Lenstra H.W., Pomerance C. (1993) Factoring integers with the number field sieve. In: Lenstra A.K., Lenstra H.W. (eds) The development of the number field sieve. Lecture Notes in Mathematics, vol 1554. Springer, Berlin, Heidelberg

Abstract

In 1990, the ninth Fermat number was factored into primes by means of a new algorithm, the “number field sieve”, which was proposed by John Pollard. The present paper is devoted to the description and analysis of a more general version of the number field sieve. It should be possible to use this algorithm to factor arbitrary integers into prime factors, not just integers of a special form like the ninth Fermat number. Under reasonable heuristic assumptions, the analysis predicts that the time needed by the general number field sieve to factor n is exp((c+o(1))(logn)1/3(loglogn)2/3) (for n → ∞), where c=(64/9)1/3=1.9223. This is asymptotically faster than all other known factoring algorithms, such as the quadratic sieve and the elliptic curve method.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1993

Authors and Affiliations

  • J. P. Buhler
    • 1
  • H. W. LenstraJr.
    • 2
  • Carl Pomerance
    • 3
  1. 1.Department of MathematicsReed CollegePortlandUSA
  2. 2.Department of MathematicsUniversity of CaliforniaBerkeleyUSA
  3. 3.Department of MathematicsUniversity of GeorgiaAthensUSA

Personalised recommendations