Lower bounds for discrete logarithms and related problems

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

Volumn 1233, Issue , 1997, Pages 256-266

  Shoup, Victor ^a  

^a IBM RESEARCH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING;

BINARY STRING; DIFFIE HELLMAN; DISCRETE LOGARITHMS; GENERIC ALGORITHM; GROUP OPERATIONS; LOWER BOUNDS; SPECIAL PROPERTIES; UPPER BOUND;

CRYPTOGRAPHY;

EID: 84942550160     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-69053-0_18     Document Type: Conference Paper

References (11)

1. L. Babai and E. Szemeredi. On the complexity of matrix group problems I. In 25th Annual Symposium, on Foundations of Computer Science, pages 229-240, 1984.
2. D. Boneh and R. J. Lipton. Algorithms for black-box fields and their application to cryptography. In Advances in Cryptology-Crypto '96, pages 283-297, 1996.
3. J. Buchmann, 1995. Personal communication.
4. O. Goldreich and L. A. Levin. A hard-core predicate for all one-way functions. In 21st Annual ACM Symposium on Theory of Computing, pages 25-32, 1989.
5. U. Maurer. Towards the equivalence of breaking the Diffie-Hellman protocol and computing discrete logarithms. In Advances in Cryptology-Crypto '94, pages 271-281, 1994.
6. U. Maurer and S. Wolf. Diffie-Hellman oracles. In Advances in Cryptology-Crypto '96, pages 268-282, 1996.
7. V. I. Nechaev. Complexity of a determinate algorithm for the discrete logarithm. Mathematical Notes, 55(2):165-172, 1994. Translated from Matematicheskie Za-metki, 55(2):91–101, 1994.
8. S. Pohlig and M. Heilman. An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. IEEE Trans. Inf. Theory, 24:106-110, 1978.
9. J. M. Pollard. Monte Carlo methods for index computation mod p. Mathematics of Computation, 32:918-924, 1978.
10. C. Schnorr. Efficient signature generation by smart cards. J. Cryptology, 4:161-174, 1991.
11. J. T. Schwartz. Fast probabilistic algorithms for verification of polynomial identities. J. ACM, 27(4):701-717, 1980.