## The Relationship Between Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms (1998)

Citations: | 37 - 3 self |

### BibTeX

@MISC{Maurer98therelationship,

author = {Ueli M. Maurer and Stefan Wolf},

title = {The Relationship Between Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms},

year = {1998}

}

### Years of Citing Articles

### OpenURL

### Abstract

Both uniform and non-uniform results concerning the security of the Diffie-Hellman key-exchange protocol are proved. First, it is shown that in a cyclic group G of order jGj = Q p e i i , where all the multiple prime factors of jGj are polynomial in log jGj, there exists an algorithm that reduces the computation of discrete logarithms in G to breaking the Diffie-Hellman protocol in G and has complexity p maxf(p i )g \Delta (log jGj) O(1) , where (p) stands for the minimum of the set of largest prime factors of all the numbers d in the interval [p \Gamma 2 p p+1; p+2 p p+ 1]. Under the unproven but plausible assumption that (p) is polynomial in log p, this reduction implies that the Diffie-Hellman problem and the discrete logarithm problem are polynomial-time equivalent in G. Second, it is proved that the Diffie-Hellman problem and the discrete logarithm problem are equivalent in a uniform sense for groups whose orders belong to certain classes: there exists a p...