Abstract
There are numerous subexponential algorithms for computing discrete logarithms over certain classes of finite fields. However, there appears to be no published subexponential algorithm for computing discrete logarithms over all finite fields. We present such an algorithm and a heuristic argument that there exists a c ∈ ℜ>0 such that for all sufficiently large prime powers p n, the algorithm computes discrete logarithms over GF(p n) within expected time:
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
Adleman L.M., A subexponential algorithm for discrete logarithms with applications to cryptography. Proc. 20th IEEE Found. Comp. Sci. Symp. 1979, pp. 55–60.
Adleman L.M., Factoring numbers using singular integers, Proc. 23rd Annual ACM Symposium on Theory of Computing, 1991. pp. 64–71.
Adleman L.M. and Huang M., Primality Testing and Abelian Varieties Over Finite Fields, Lecture Notes In Mathematics 1512, Springer-Verlag, 1992.
Adleman L.M. and Lenstra H.W. Jr., Finding irreducible polynomials over finite fields. Proc. 18th Annual ACM Symposium on Theory of Computing, 1986, pp. 350–355.
Berlekamp E., Factoring polynomials over large finite fields. Math. Comp. 24, 1970. pp. 713–735.
Bach E. and Shallit J., Factoring with cyclotomic polynomials. Proc. 26th IEEE Found. Comp. Sci. Symp. 1985, pp. 443–450.
Canfield E.R., Erdös P. and Pomerance C, On a problem of Oppenhiem concerning “Factorisatio Nemerorum”. J. Number Theory, 17, 1983 pp. 1–28.
Coppersmith D., Fast Evaluation of Logarithms in Fields of Characteristic Two. IEEE Trans on Information Theory, vol IT-30, No 4, July 1984, pp. 587–594.
Coppersmith D., Odlyzko A.M. and Schroeppel R., Discrete logarithms in GF(p), Algorithmica, v. 1, 1986, pp 1–15.
Diffie W. and Hellman M.E., New Directions in Cryptography, IEEE Trans. Inform Theory, vol IT-22, pp 644–654, 1976
Edwards H.M., Fermat’s Last Theorem, Graduate Texts in Mathematics 50, Springer-Verlag, 1977.
ElGamal T., A public key cryptosystem and a signature scheme based on discrete logarithms, IEEE Trans. Info. Theory, vol IT-31 pp. 469–472, 1985
ElGamal T., A subexponential-time algorithm for computing discrete logarithms over GF(p 2), IEEE Trans. Info. Theory, vol IT-31 pp. 473–481, 1985
Gauss K.P., Disquisitiones Arithmeticae, translation A.C. Clarke, S.J., Yale University Press, 1966.
Gordon D.M., Discrete logarithms in GF(p) using the number field sieve, manuscript, April 4, 1990.
Hellman M. E., Reyneri J. M. Fast computation of discrete logarithms in GF(q). Advances in Cryptography: Proceedings of CRYPTO’ 82, pp. 3–13
Lenstra H.W. Jr., Finding isomorphisms between finite fields. Math Comp 56, 1991, pp. 329–347.
Lenstra H.W. Jr., Factoring integers with elliptic curves. Ann. of Math. 126, 1987, pp. 649–673.
Lenstra A.K., Lenstra H.W., Jr., Manasse M.S. and Pollard J.M. The number field sieve. Proc. 22nd STOC, 1990, pp. 564–572.
Lovorn R., Rigorous, subexponenial algorithms for discrete logarithms over finite fields, PhD Thesis, University of Georgia, May 1992
Newman M., Bounds for class numbers, Proc. Sympos. Pure Math. American Mathematics Society, Vol. VIII, 1965, pp 70–77.
Odlyzko A. M., Discrete Logarithms in Finite Fields and their Cryptographic Significance, Proceedings of Eurocrypt’ 84, Lecture Notes in Computer Science, Springer-Verlag. 1985. pp. 224–314.
Pomerance C. Fast, rigorous factorization and discrete logarithms, Discrete Algorithms and Complexity. ED. Johnson D.S., Nishizeki T., Nozaki A. and Wilf H.S. Academic Press, 1987. pp. 119–144.
Rabin M. O., Probabilistic Algorithms in Finite Fields. SIAM Journal of Computing, Vol 9, No 2, May 1980, pp. 273–280
Solovay R. and Strassen V., A fast Monte-Carlo test for primality. Siam Journal of Computing 6, 1977. pp. 84–85.
Washington L.C., Introduction to Cyclotomic Fields, Graduate Texts in Mathematics 83, Springer-Verlag, 1982.
Wiedermann D. Solving sparse linear equations over finite fields. IEEE Trans. Inform. Theory. IT-32, pp. 54–62
Western A.E. and Miller J.C.P., Tables of Indices and Primitive Roots, Royal Society Mathematical Tables, vol. 9., Cambridge University Press, 1968.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Adleman, L.M., DeMarrais, J. (1994). A Subexponential Algorithm for Discrete Logarithms over All Finite Fields. In: Stinson, D.R. (eds) Advances in Cryptology — CRYPTO’ 93. CRYPTO 1993. Lecture Notes in Computer Science, vol 773. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48329-2_13
Download citation
DOI: https://doi.org/10.1007/3-540-48329-2_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57766-9
Online ISBN: 978-3-540-48329-8
eBook Packages: Springer Book Archive