Abstract
The Merkte-Adleman algorithm computes discrete logarithms in GF (q),the finite field with q elements, in subexponential time, when q is a prime number p. This paper shows that similar asymptotic behavior can be obtained for the logarithm problem when q = p m, in the case that m grows with p fixed. A method of partial precomputation, applicable to either problem, is also presented. The precomputation is particularly useful when many logarithms need to be computed for fixed values of p and m.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. Pohlig and M. Hellman, “An improved algorithm for computing logarithms over GF(p) and its cryptographic significance,” IEEE Trans. on Inform. Theory, vol. IT-24, pp. 106–110, Jan. 1978.
W. Diffie and M. E. Hellman, “New directions in cryptography,” IEEE Trans. on Inform. Theory, vol. IT-22, pp. 644–654, Nov. 1976.
R. L. Rivest, A. Shamir and L. Adleman, “A method for obtaining digital signatures and public-key cryptosystems,” Communications of the ACM, vol. 21, no. 2, February 1978
R. Merkte, Secrecy, Authentication, and Public Key Systems, Ph.D. dissertation, Department of Electrical Engineering, Stanford University, June 1979.
S. C. Pohlig, Algebraic and Combinatoric Aspects of Cryptography, Ph.D. Dissertation, Department of Electrical Engineering, Stanford University, Oct. 1977
L. Adleman, “A subexponetial algorithm for the discrete logarithm with applications to cryptography,” Proceedings of the 20th Annual Symposium on Foundations of Computer Science, Oct. 29–31, 1979
S. Berkovits, J. Kowalchuk, and B. Schanning, “Implementing public-key scheme,” IEEE Commun. Mag., vol. 17, pp 2–3, May 1979
J. D. Dixon, “Asymptotically fast factorization of integers,” Math. Comp., vol. 38, no. 153, Jan. 1981
E.R. Berlekamp, Algebraic Coding Theory, New York: McGraw Hill, 1978
W. Feller, An Introduction to Probability Theory and Its Applications, 3rd ed. New York: Wiley, 1968.
R. Schroeppel, Private communication
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1983 Springer Science+Business Media New York
About this paper
Cite this paper
Hellman, M.E., Reyneri, J.M. (1983). Fast Computation of Discrete Logarithms in GF (q). In: Chaum, D., Rivest, R.L., Sherman, A.T. (eds) Advances in Cryptology. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-0602-4_1
Download citation
DOI: https://doi.org/10.1007/978-1-4757-0602-4_1
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-0604-8
Online ISBN: 978-1-4757-0602-4
eBook Packages: Springer Book Archive