Abstract
In this note we provide a number of polynomial formulas for the discrete logarithm problem in an arbitrary multiplicative subgroup of a finite field. These formulas generalize previous formulas for computing logarithms in the multiplicative group of all nonzero elements.
Similar content being viewed by others
References
Lidl, R., Niederreiter, H.: Finite Fields, Encyclo. Math. Appls., Vol. 20. Addison-Wesley, Reading, MA 1983. (Now distributed by Camb. Univ. Press)
Lidl, R., Niederreiter, H.: Introduction to Finite Fields and Their Applications. Cambridge: Camb. Univ. Press 1986
Mullen, G. L., White, D.: A polynomial representation for logarithms in GF(q). Acta Arith.47, 255–261 (1986)
Niederreiter, H.: A short proof for explicit formulas for discrete logarithms in finite fields. App. Alg. Eng. Comm. Comp.1, 55–57 (1990)
Odlyzko, A. M.: Discrete logarithms in finite fields and their cryptographic significance. Proc. EUROCRYPT, Vol. 84, pp. 224–314. Lect. Notes in Comp. Sci., Vol. 209. Berlin, Heidelberg, New York: Springer 1985
Pollard, J. M.: The fast Fourier transform in a finite field. Math. Computation25, 365–374 (1971)
Wells, A. L., Jr.: A polynomial form for logarithms modulo a prime. IEEE Trans. Inform. TheoryIT-30, 845–846 (1984)
Author information
Authors and Affiliations
Additional information
This author would like to thank the NSA for partial support under grant agreement #MDA904-87-H-2023.
Rights and permissions
About this article
Cite this article
Meletiou, G., Mullen, G.L. A note on discrete logarithms in finite fields. AAECC 3, 75–78 (1992). https://doi.org/10.1007/BF01189026
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01189026