A note on discrete logarithms with special structure

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 658 LNCS, Issue , 1993, Pages 454-457

  Heiman, Rafi ^a  

^a TELCORDIA TECHNOLOGIES   (United States)

Author keywords

Computational Difficulty; Cryptographic System; Discrete Logarithm; Discrete Logarithm Problem; Exhaustive Search Algorithm

Indexed keywords

COMPUTATION THEORY;

COMPUTATIONAL DIFFICULTY; CRYPTOGRAPHIC SYSTEMS; DISCRETE LOGARITHM PROBLEMS; DISCRETE LOGARITHMS; EXHAUSTIVE SEARCH ALGORITHMS;

CRYPTOGRAPHY;

EID: 85034504275     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47555-9_38     Document Type: Conference Paper

References (7)

1. 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.
2. D.E. Knuth. The art of computer programming, vol. 3: sorting and searching. Addison-Wesley, Reading, Mass., 1973.
3. A.K. Lenstra and H.W. Lenstra. Algorithms in Number Theory, volume A, chapter 12, pages 673-716. MIT press, 1990.
4. A. Odlyzko. Private communication.
5. J.M. Pollard. Monte Carlo methods for index computation (mod p). Mathematics of computation, 32(143):918-924, July 1978.
6. 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.
7. Y. Yacobi. Discrete-log with compressible exponents. In Advances in Cryptology, Crypto90, pages 639-643, 1990.