Lower Bounds for Discrete Logarithms and Related Problems
- 1 January 1997
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 256-266
- https://doi.org/10.1007/3-540-69053-0_18
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete LogarithmsPublished by Springer Nature ,2001
- Algorithms for Black-Box Fields and their Application to CryptographyLecture Notes in Computer Science, 1996
- Diffie-Hellman OraclesLecture Notes in Computer Science, 1996
- Complexity of a determinate algorithm for the discrete logarithmMathematical Notes, 1994
- Efficient signature generation by smart cardsJournal of Cryptology, 1991
- A hard-core predicate for all one-way functionsPublished by Association for Computing Machinery (ACM) ,1989
- On The Complexity Of Matrix Group Problems IPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1984
- Fast Probabilistic Algorithms for Verification of Polynomial IdentitiesJournal of the ACM, 1980
- Monte Carlo Methods for Index Computation (mod p)Mathematics of Computation, 1978
- An improved algorithm for computing logarithms overGF(p)and its cryptographic significance (Corresp.)IEEE Transactions on Information Theory, 1978