---
title: Diffie–Hellman problem
slug: diffie-hellman-problem
qid: 
snapshot: enwiki-001307759835
content_hash: 
license: CC BY-SA 4.0
source: https://en.wikipedia.org/w/index.php?oldid=1307759835
tags: [107195930, 11060667, 22922474, 23145706, 23145707, 23453155, 23603337, 24745114, 26220375, 28023784, 29176329, 7692542]
---

# Diffie–Hellman problem

> [!note] Provenance
> Snapshot `enwiki-001307759835` · content root `…`
> Derived from <https://en.wikipedia.org/w/index.php?oldid=1307759835> · Licensed CC BY-SA 4.0

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.

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. ==References== B. den Boer, Diffie–Hellman is as strong as discrete log for certain primes in Advances in Cryptology – CRYPTO 88, Lecture Notes in Computer Science 403, Springer, p.&nbsp;530, 1988. U. M. Maurer and S. Wolf, Diffie–Hellman oracle in Advances in Cryptology – CRYPTO 96, (N. Koblitz, ed.), Lecture Notes in Computer Science 1070, Springer, pp.&nbsp;268–282, 1996. D. Boneh and R. J. Lipton, Algorithms for black-box fields and their application to cryptotography in Advances in Cryptology – CRYPTO 96, (N. Koblitz, ed.), Lecture Notes in Computer Science 1070, Springer, pp.&nbsp;283–297, 1996. A. Muzereau, N. P. Smart and F. Vercauteran, The equivalence between the DHP and DLP for elliptic curves used in practical applications, LMS J. Comput. Math., 7, pp.&nbsp;50–72, 2004. See [www.lms.ac.uk]. D. R. L. Brown and R. P. Gallant, The Static Diffie–Hellman Problem, IACR ePrint 2004/306. V. I. Nechaev, Complexity of a determinate algorithm for the discrete logarithm, Mathematical Notes, 55 (2), pp.&nbsp;165–172, 1994. V. Shoup, Lower bounds for discrete logarithms and related problems in Advances in Cryptology – EUROCRYPT 97, (W. Fumy, ed.), Lecture Notes in Computer Science 1233, Springer, pp.&nbsp;256–266, 1997.
