Diffie–Hellman problem

This article's lead section contains information that is not included elsewhere in the article. If the information is appropriate for the lead of the article, this information should also be included in the body of the article. (June 2023) (Learn how and when to remove this message)

This article includes a list of references, related reading, or external links, but its sources remain unclear because it lacks inline citations. Please help improve this article by introducing more precise citations. (October 2017) (Learn how and when to remove this message)

The Diffie–Hellman problem (DHP) is a mathematical problem first proposed by Whitfield Diffie and Martin Hellman^[1] in the context of cryptography and serves as the theoretical basis of the Diffie–Hellman key exchange and its derivatives. The motivation for this problem is that many security systems use one-way functions: mathematical operations that are fast to compute, but hard to reverse. For example, they enable encrypting a message, but reversing the encryption is difficult. If solving the DHP were easy, these systems would be easily broken.

The Diffie–Hellman problem is stated informally as follows:

Given an element ${\displaystyle g}$ and the values of ${\displaystyle g^{x}}$ and ${\displaystyle g^{y}}$, what is the value of ${\displaystyle g^{xy}}$?

Formally, ${\displaystyle g}$ is a generator of some group (typically the multiplicative group of a finite field or an elliptic curve group) and ${\displaystyle x}$ and ${\displaystyle y}$ are randomly chosen integers.

For example, in the Diffie–Hellman key exchange, an eavesdropper observes ${\displaystyle g^{x}}$ and ${\displaystyle g^{y}}$ exchanged as part of the protocol, and the two parties both compute the shared key ${\displaystyle g^{xy}}$. A fast means of solving the DHP would allow an eavesdropper to violate the privacy of the Diffie–Hellman key exchange and many of its variants, including ElGamal encryption.

In cryptography, for certain groups, it is assumed that the DHP is hard, and this is often called the Diffie–Hellman assumption. The problem has survived scrutiny for a few decades and no "easy" solution has yet been publicized.

As of 2006, the most efficient means known to solve the DHP is to solve the discrete logarithm problem (DLP), which is to find x given g and g^x. In fact, significant progress (by den Boer, Maurer, Wolf, Boneh and Lipton) has been made towards showing that over many groups the DHP is almost as hard as the DLP. There is no proof to date that either the DHP or the DLP is a hard problem, except in generic groups (by Nechaev and Shoup). A proof that either problem is hard implies that P ≠ NP.

Many variants of the Diffie–Hellman problem have been considered. The most significant variant is the decisional Diffie–Hellman problem (DDHP), which is to distinguish g^xy from a random group element, given g, g^x, and g^y. Sometimes the DHP is called the computational Diffie–Hellman problem (CDHP) to more clearly distinguish it from the DDHP. Recently groups with pairings have become popular, and in these groups the DDHP is easy, yet the CDHP is still assumed to be hard. For less significant variants of the DHP see the references.

• Discrete logarithm problem
• Elliptic-curve cryptography