Diffie-Hellman, decision Diffie-Hellman, and discrete logarithms

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 1998, Pages 327-

  Maurer, U ^a   Wolf, S ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION DIFFIE-HELLMAN; DECISION PROBLEMS; DIFFIE HELLMAN; DIFFIE-HELLMAN PROBLEM; DISCRETE LOGARITHM PROBLEMS; DISCRETE LOGARITHMS; POLYNOMIAL-TIME; PRIME FACTORS;

INFORMATION THEORY;

EID: 0346761925     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.1998.708932     Document Type: Conference Paper

References (3)

1. U. Maurer and S. Wolf, "Lower bounds on generic algorithms in groups," Advances in Cryptology-EUROCRYPT '98, Lecture Notes in Computer Science, Springer-Verlag, 1998.
2. U. Maurer and S. Wolf, "The relationship between breaking the Diffie-Hellman protocol and computing discrete logarithms," to appear in SIAM Journal oj Computing, 1998.
3. V. Shoup, "Lower bounds for discrete logarithms and related problems," Advances in Cryptology-EUROCRYPT '97, Lecture Notes in Computer Science, vol. 1233, pp. 256-266, Springer-Verlag, 1997.