Abstract
Several related algorithms are presented for computing logarithms in fieldsGF(p),p a prime. Heuristic arguments predict a running time of exp((1+o(1))\(\sqrt {\log p \log \log p} \)) for the initial precomputation phase that is needed for eachp, and much shorter running times for computing individual logarithms once the precomputation is done. The running time of the precomputation is roughly the same as that of the fastest known algorithms for factoring integers of size aboutp. The algorithms use the well known basic scheme of obtaining linear equations for logarithms of small primes and then solving them to obtain a database to be used for the computation of individual logarithms. The novel ingredients are new ways of obtaining linear equations and new methods of solving these linear equations by adaptations of sparse matrix methods from numerical analysis to the case of finite rings. While some of the new logarithm algorithms are adaptations of known integer factorization algorithms, others are new and can be adapted to yield integer factorization algorithms.
Similar content being viewed by others
References
L. M. Adleman, “A subexponential algorithm for the discrete logarithm problem with applications to cryptography,”Proc. 20th IEEE Found. Comp. Sci. Symp. (1979), 55–60.
E. R. Canfield, P. Erdös and C. Pomerance, “On a problem of Oppenheim concerning ‘Factorisatio Numerorum’,”J. Number Theory, vol. 17, 1983, pp. 1–28.
D. Coppersmith, “Fast evaluation of logarithms in fields of characteristic two,”IEEE Trans. Inform. Theory IT-30 (1984), 587–594.
D. Coppersmith and S. Winograd, “On the asymptotic complexity of matrix multiplication,”SIAM J. Comput., Vol. 11, No. 3, August 1982, pp. 472–492.
T. ElGamal, “A subexponential-time algorithm for computing discrete logarithms overGF(p 2),”IEEE Trans. Inform. Theory, to appear.
M. R. Hestenes and E. Stiefel, “Method of conjugate gradients for solving linear systems,”J. Res. Nat. Bur. Standards, Sect. B, vol. 49 (1952), pp. 409–436.
C. Lanczos, “An iterative method for the solution of the eigenvalue problem of linear differential and integral operators,”J. Res. Nat. Bur. Standards, Sect. B, vol. 45 (1950), pp. 255–282.
H. W. Lenstra, Jr., paper in preparation.
A. M. Odlyzko, “Discrete logarithms in finite fields and their cryptographic significance,” to appear,Proceedings of Eurocrypt '84, Springer Lecture Notes in Computer Science.
J. M. Pollard, “A Monte Carlo method for factorization,”BIT 15 (1975), 331–334.
C. Pomerance, “Analysis and comparison of some integer factoring algorithms,” pp. 89–139 inComputational Methods in Number Theory: Part I, H. W. Lenstra, Jr., and R. Tijdeman, eds., Math. Centre Tract 154, Math. Centre Amsterdam, 1982.
J. M. Reyneri, unpublished manuscript.
V. Strassen, “Gaussian elimination is not optimal,”Numer. Math., 13 (1969), pp. 354–356.
D. Wiedemann, “Solving sparse linear equations over finite fields,”IEEE Trans. Inform. Theory, to appear.
A. E. Western and J. C. P. Miller,Tables of Indices and Primitive Roots, Royal Society Mathematical Tables, vol. 9, Cambridge Univ. Press, 1968.
Author information
Authors and Affiliations
Additional information
Communicated by C. K. Wong.
Rights and permissions
About this article
Cite this article
Coppersmith, D., Odlzyko, A.M. & Schroeppel, R. Discrete logarithms inGF(p). Algorithmica 1, 1–15 (1986). https://doi.org/10.1007/BF01840433
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01840433