A Subexponential Algorithm for Discrete Logarithms over All Finite Fields

This publication has 24 references indexed in Scilit:

• Factoring numbers using singular integers
  Published by Association for Computing Machinery (ACM) ,1991
• Discrete logarithms inGF(p)
  Algorithmica, 1986
• Finding irreducible polynomials over finite fields
  Published by Association for Computing Machinery (ACM) ,1986
• Factoring with cyclotomic polynomials
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1985
• Fast evaluation of logarithms in fields of characteristic two
  IEEE Transactions on Information Theory, 1984
• On a problem of Oppenheim concerning “factorisatio numerorum”
  Journal of Number Theory, 1983
• A subexponential algorithm for the discrete logarithm problem with applications to cryptography
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1979
• Fermat’s Last Theorem
  Published by Springer Nature ,1977
• New directions in cryptography
  IEEE Transactions on Information Theory, 1976
• Factoring Polynomials Over Large Finite Fields
  Mathematics of Computation, 1970