Abstract
Many cryptographic systems assume the computational difficulty of the discrete logarithm (DL) problem. In order to accelerate such practical systems, it was proposed to use logarithms of special structure, such as small Hamming weight. How difficult is the underlying restricted DL problem? By rephrasing Shanks’ method we provide a close to square-root algorithm for such problems.
Chapter PDF
Similar content being viewed by others
Keywords
- Discrete Logarithm
- Discrete Logarithm Problem
- Computational Difficulty
- Cryptographic System
- Exhaustive Search Algorithm
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
G.B. Agnew, R.C. Mullin, I.M. Onyszchuk, and S.A. Vanstone. An implementation for a fast public-key cryptosystem. Journal of Cryptology, 3(2):63–79, 1991.
D.E. Knuth. The art of computer programming, vol. 3: sorting and searching. Addison-Wesley, Reading, Mass., 1973.
A.K. Lenstra and H.W. Lenstra. Algorithms in Number Theory, volume A, chapter 12, pages 673–716. MIT press, 1990.
A. Odlyzko. Private communication.
J.M. Pollard. Monte Carlo methods for index computation (mod p). Mathematics of computation, 32(143):918–924, July 1978.
T. Rosati. A high speed data encryption processor for public key cryptography. In IEEE Custom Integrated Circuits Conference, pages 12.3.1–12.3.5, May 1989.
Y. Yacobi. Discrete-log with compressible exponents. In Advances in Cryptology, Crypto90, pages 639–643, 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Heiman, R. (1993). A Note on Discrete Logarithms with Special Structure. In: Rueppel, R.A. (eds) Advances in Cryptology — EUROCRYPT’ 92. EUROCRYPT 1992. Lecture Notes in Computer Science, vol 658. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47555-9_38
Download citation
DOI: https://doi.org/10.1007/3-540-47555-9_38
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56413-3
Online ISBN: 978-3-540-47555-2
eBook Packages: Springer Book Archive