Corpus ID: 123670445

The Development of the Number Field Sieve

@inproceedings{Lenstra1993TheDO,
  title={The Development of the Number Field Sieve},
  author={A. K. Lenstra and H. Lenstra},
  year={1993}
}
The number field sieve is an algorithm to factor integers of the form $r^e-s$ for small positive $r$ and $s$. The authors present a report on work in progress on this algorithm. They informally describe the algorithm, discuss several implementation related aspects, and present some of the factorizations obtained so far. They also mention some solutions to the problems encountered when generalizing the algorithm to general integers using an idea of Buhler and Pomerance. It is not unlikely that… Expand
333 Citations
The Space Complexity Analysis in the General Number Field Sieve Integer Factorization
  • 6
The Number Field Sieve
  • 1
  • Highly Influenced
A Multiple Polynominal General Number Field Sieve
  • 16
  • PDF
Cubic Polynomials in the Number Field Sieve
  • 9
  • PDF
The function field sieve
  • 130
Approximatting rings of integers in number fields.
  • 50
  • PDF
An Implementation of the General Number Field Sieve to Compute Discrete Logarithms mod p
  • 11
  • PDF
On General Number Field Sieve and its Polynomial Selection
...
1
2
3
4
5
...