Mathematical Notes

, Volume 55, Issue 2, pp 165–172 | Cite as

Complexity of a determinate algorithm for the discrete logarithm

  • V. I. Nechaev


Discrete Logarithm Determinate Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    J. Buchman and S. Paulus, “Algorithms for finite abelian groups,” in: Number Theoretic and Algebraic Methods in Computer Science, Conference Abstracts (1993), pp. 22–27.Google Scholar
  2. 2.
    D. Shanks, “Class number. A theory of factorization and genera,” in: Proc. Symp. Pure Math., Vol. 20, AMS (1970), pp. 415–440.Google Scholar
  3. 3.
    D. Knuth, The Art of Computer Programming [Russian translation], Vol. 3, Mir, Moscow (1978).Google Scholar
  4. 4.
    R. Lidl and H. Niederreiter, Introduction to Finite Fields and Their Applications, Cambridge University Press, Cambridge-New York-Melbourne-Sydney (1986).Google Scholar
  5. 5.
    S. C. Pohlig and M. E. Hellman, “An improved algorithm for computing logarithms over GF(p) and its cryptographic significance,” IEEE. Trans. Information Theory,24, 106–110 (1978).CrossRefGoogle Scholar
  6. 6.
    J. F. Blake, R. Fuji-Hara, R. C. Mullin, and S. A. Vanstone, “Computing logarithms in finite fields of characteristic two,” Algebraic Discrete Methods,5, 276–285 (1984).Google Scholar
  7. 7.
    D. Coppersmith, “Fast evaluation of logarithms in fields of characteristic two,” IEEE. Trans. Information Theory,30, 587–594 (1984).Google Scholar

Copyright information

© Plenum Publishing Corporation 1994

Authors and Affiliations

  • V. I. Nechaev
    • 1
  1. 1.Steklov Mathematics InstituteRussian Academy of SciencesUSSR

Personalised recommendations