Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > DIFFIE-HELLMAN PROBLEM:
Reports tagged with Diffie-Hellman problem:
TR05-124 | 2nd November 2005
Kooshiar Azimian

Breaking Diffie-Hellman is no Easier than Root Finding

In this paper we compare hardness of two well known problems: the Diffie-Hellman problem and the root finding problem. We prove that in any cyclic group computing Diffie-Hellman is not weaker than root finding if certain circumstances are met. As will be discussed in the paper this theorem can affect ... more >>>




ISSN 1433-8092 | Imprint