ETH Zürich » Computer Science » Theory » Cryptography

Publications: Abstract

On the Hardness of the {D}iffie-{H}ellman Decision Problem

Ueli Maurer and Stefan Wolf

It is shown that in the model of generic algorithms, the Diffie-Hellman decision problem is not polynomial-time computationally equivalent to the Diffie-Hellman problem.