A general number field sieve implementation

  • Daniel J. Bernstein
  • A. K. Lenstra
Conference paper
Part of the Lecture Notes in Mathematics book series (LNM, volume 1554)

Abstract

The general number field sieve is the asymptotically fastest—and by far most complex—factoring algorithm known. We have implemented this algorithm, including five practical improvements: projective polynomials, the lattice sieve, the large prime variation, character columns, and the positive square root method. In this paper we describe our implementation and list some factorizations we obtained, including the record factorization of 2523 − 1.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1993

Authors and Affiliations

  • Daniel J. Bernstein
    • 1
    • 2
  • A. K. Lenstra
    • 1
    • 2
  1. 1.BellportUSA
  2. 2.MorristownUSA

Personalised recommendations