Skip to main content
Springer Nature Link
Log in

A short proof for explicit formulas for discrete logarithms in finite fields

  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Blum, M., Micali, S.: How to generate cryptographically strong sequences of pseudo-random bits. SIAM J. Computing13, 850–864 (1984)

    Google Scholar 

  2. Chor, B., Rivest, R. L.: A knapsack type public key cryptosystem based on arithmetic in finite fields. Proc. CRYPTO 84, pp. 54–65. Lecture Notes in Computer Science, Vol.196. Berlin, Heidelberg, New York: Springer 1985

    Google Scholar 

  3. Chor, B., Rivest, R. L.: A knapsack-type public key cryptosystem based on arithmetic in finite fields. IEEE Trans. Inform. Theory34, 901–909 (1988)

    Google Scholar 

  4. Coppersmith, D.: Methods and results in cryptography. Applications of Discrete Mathematics. Ringeisen, R. D., Roberts, F. S. (eds.), pp. 24–31. Philadelphia: SIAM 1988

    Google Scholar 

  5. Coppersmith, D., Odlyzko, A. M., Schroeppel, R.: Discrete logarithms in GF(p). Algorithmica1, 1–15 (1986)

    Google Scholar 

  6. Lidl, R., Niederreiter, H.: Finite fields. Reading, MA: Addison-Wesley 1983

    Google Scholar 

  7. Lidl, R., Niederreiter, H.: Introduction to finite fields and their applications. Cambridge: Cambridge University Press 1986

    Google Scholar 

  8. Mullen, G. L., White, D.: A polynomial representation for logarithms in GF(q). Acta Arith.47, 255–261 (1986)

    Google Scholar 

  9. Odlyzko, A. M.: Discrete logarithms in finite fields and their cryptographic significance. Proc. EUROCRYPT 84, pp. 224–314. Lecture Notes in Computer Science, Vol.209. Berlin, Heidelberg, New York: Springer 1985

    Google Scholar 

  10. Pomerance, C.: Fast, rigorous factorization and discrete logarithm algorithms. Discrete Algorithms and Complexity (Proc. Japan—US Joint Seminar, Kyoto, 1986), pp. 119–143. Boston: Academic Press 1987

    Google Scholar 

  11. Wells, A. L., Jr.: A polynomial form for logarithms modulo a prime. IEEE Trans. Inform. Theory30, 845–846 (1984)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Information Processing, Austrian Academy of Sciences, Dr.-Ignaz-Seipel-Platz 2, A-1010, Vienna, Austria

    Harald Niederreiter

Authors
  1. Harald Niederreiter
    View author publications

    You can also search for this author inPubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Niederreiter, H. A short proof for explicit formulas for discrete logarithms in finite fields. AAECC 1, 55–57 (1990). https://doi.org/10.1007/BF01810847

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords