The number field sieve

This publication has 26 references indexed in Scilit:

• The factorization of the ninth Fermat number
  Mathematics of Computation, 1993
• A general number field sieve implementation
  Lecture Notes in Mathematics, 1993
• Computing a square root for the number field sieve
  Lecture Notes in Mathematics, 1993
• Algorithms in Algebraic Number Theory
  Bulletin of the American Mathematical Society, 1992
• Reduction of Huge, Sparse Matrices over Finite Fields Via Created Catastrophes
  Experimental Mathematics, 1992
• Generation of Elements with Small Modular Squares and Provably Fast Integer Factoring Algorithms
  Mathematics of Computation, 1991
• Discrete logarithms inGF(p)
  Algorithmica, 1986
• A subexponential-time algorithm for computing discrete logarithms overGF(p^2)
  IEEE Transactions on Information Theory, 1985
• Fast evaluation of logarithms in fields of characteristic two
  IEEE Transactions on Information Theory, 1984
• Refined analysis and improvements on some factoring algorithms
  Journal of Algorithms, 1982