Live briefing
Everything about Diffie–Hellman problem
Problem in cryptography
The Diffie–Hellman problem (DHP) is a mathematical problem first proposed by Whitfield Diffie and Martin Hellman 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. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Diffie–Hellman problemA 5-minute orientation
- Skim a recent paper: Breaking the Decisional Diffie–Hellman Problem for Class Group Actions Using Genus Theory: Extended VersionInfluential work since 2022
- Pick up a classic book: Computer NetworksThe most-reprinted book on the subject
- Read the landmark paper: The Twin Diffie–Hellman Problem and ApplicationsCited 62 times
- Go sideways: Computational Diffie–Hellman assumptionA closely related topic
- Go sideways: Pairing-based cryptographyA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
The Twin Diffie–Hellman Problem and Applications
On the decisional Diffie–Hellman problem for class group actions on oriented elliptic curves
Polynomial interpolation of cryptographic functions related to Diffie–Hellman and discrete logarithm problem
On the connection between the discrete logarithms and the Diffie-Hellman problem
The Diffie–Hellman problem and generalization of Verheul’s theorem
The square root Diffie–Hellman problem
On the bit security of the weak Diffie–Hellman problem
Efficient probabilistic public-key cryptosystem based on the diffie-hellman problem
🆕 Influential since 2022
đź“š Books worth reading
Computer NetworksAndrew S. Tanenbaum, John David Wetherall · 1981- 📕The mathematics of public key cryptographySteven D. Galbraith · 2012
An introduction to mathematical cryptographyJeffrey Hoffstein · 2008
TCP/IP IllustratedW. Richard Stevens, Kevin R. Fall · 1993
A cryptography primerPhilip N. Klein · 2014
Cryptography and network securityWilliam Stallings · 2006
Codes and CiphersR. F. Churchhouse · 2001
Understanding cryptographyChristof Paar · 2010
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Computational Diffie–Hellman assumption The computational Diffie–Hellman (CDH) assumption is a computational hardness assumption about the Diffie–Hellman problem. The CDH assumption involves…
- Pairing-based cryptography Pairing-based cryptography is the use of a pairing between elements of two cryptographic groups to a third group with a mapping e : G 1 × G 2 → G T {\displaysty…
- Computational hardness assumption In computational complexity theory, a computational hardness assumption is the hypothesis that a particular problem cannot be solved efficiently (where…
- BLS digital signature A BLS digital signature, also known as Boneh–Lynn–Shacham (BLS), is a cryptographic signature scheme which allows a user to verify that a signer is authentic…
- Elliptic-curve cryptography Elliptic-curve cryptography (ECC) is an approach to public-key cryptography based on the algebraic structure of elliptic curves over finite fields. ECC…
- Trapdoor function In theoretical computer science and cryptography, a trapdoor function is a function that is easy to compute in one direction, yet difficult to compute…
- Elliptic-curve Diffie–Hellman Elliptic-curve Diffie–Hellman (ECDH) is a key agreement protocol that allows two parties, each having an elliptic-curve public–private key pair, to establish…
- XDH assumption The external Diffie–Hellman (XDH) assumption is a computational hardness assumption used in elliptic curve cryptography. The XDH assumption holds if there…