Skip to main content
Log in

Complexity of a determinate algorithm for the discrete logarithm

  • Published:
Mathematical Notes Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  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.

  2. D. Shanks, “Class number. A theory of factorization and genera,” in: Proc. Symp. Pure Math., Vol. 20, AMS (1970), pp. 415–440.

  3. D. Knuth, The Art of Computer Programming [Russian translation], Vol. 3, Mir, Moscow (1978).

    Google Scholar 

  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. 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).

    Article  Google Scholar 

  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. D. Coppersmith, “Fast evaluation of logarithms in fields of characteristic two,” IEEE. Trans. Information Theory,30, 587–594 (1984).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Translated from Matematicheskie Zametki, Vol. 55, No. 2, pp. 91–101, February, 1994.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nechaev, V.I. Complexity of a determinate algorithm for the discrete logarithm. Math Notes 55, 165–172 (1994). https://doi.org/10.1007/BF02113297

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02113297

Keywords

Navigation