Welcome to the resource topic for 2001/003
Title:
Separating Decision Diffie-Hellman from Diffie-Hellman in cryptographic groups
Authors: Antoine Joux, Kim Nguyen
Abstract:In many cases, the security of a cryptographic scheme based on Diffie–Hellman does in fact rely on the hardness of the
Diffie–Hellman Decision problem. In this paper, we show that the
hardness of Decision Diffie–Hellman is a much stronger hypothesis than the hardness of the regular Diffie–Hellman problem. Indeed, we
describe a reasonably looking cryptographic group where Decision
Diffie–Hellman is easy while Diffie–Hellman is equivalent to a –
presumably hard – Discrete Logarithm Problem. This shows that care
should be taken when dealing with Decision Diffie–Hellman, since its
security cannot be taken for granted.
ePrint: https://eprint.iacr.org/2001/003
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .