Abstract
We describe a method for computing discrete logarithms in any nonsimple cyclic group, which may be considered as a serial version of the Pohlig-Hellman Algorithm. The complexity is the same as that of the P-H Algorithm, but does not need the Chinese Remainder Theorem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Adleman L. M.: A Subexponential Algorithm for the Discrete Logarithm Problem with Applications to Cryptography. Proceedings, 20th IEEE Found Comp. Sci. Symp., 55–60 (1979)
Blake I. F., Fuji Hara R., Mullin R. C., Vanstone S. A.: Computing logarithms in finite fields of characteristic two. SIAM J. Alg. Disc Meth.5(2), 276–285 (1984)
Don Coppersmith: Fast evaluation of logarithms in fields of characteristic two. IEEE Trans. Inform. Theory IT30(4), 587–594 (1984)
Diffie W., Hellman M. E.: New directions in cryptography. IEEE Trans. Inform. Theory IT32, 644–654 (1976)
Knuth D. E.: The Art of Computer Programming. Vol 2, Addison Wesley Reading 1986
Koblitz N.: A course in number theory and cryptography. Berlin, Heidelberg, New York: Springer 1987
Kranakis E.: Primality and cryptography. Wiley-Teubner series in Computer Science. Stuttgart: John Wiley and B. G. Teubner 1986
Lidl R., Niederreiter H.: Introduction to finite fields and their applications. Cambridge: Cambridge University Press 1986
Pohlig S. C., Hellman M.: An improved algorithm for computing logarithms over GF (p) and its cryptographic significance. IEEE Trans. Inf. Theory IT24, 106–110 (1978)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Thiong Ly, J.A. A serial version of the Pohlig-Hellman Algorithm for computing discrete logarithms. AAECC 4, 77–80 (1993). https://doi.org/10.1007/BF01270401
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01270401