Information Security and Cryptography Research Group

On the Hardness of the Diffie-Hellman Decision Problem

Ueli Maurer and Stefan Wolf

1998, Manuscript.

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.

BibTeX Citation

    author       = {Ueli Maurer and Stefan Wolf},
    title        = {On the Hardness of the {D}iffie-{H}ellman Decision Problem},
    year         = {1998},
    note         = {Manuscript},

Files and Links