e/Diffie–Hellman problem

Information
has gloss	eng: The Diffie–Hellman problem (DHP) is a mathematical problem first proposed by Whitfield Diffie and Martin Hellman in the context of cryptography. The motivation for this problem is that many security systems use 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 problem was easy, these systems would be easily broken.
lexicalization	eng: Diffie-Hellman problem
lexicalization	eng: Diffie–Hellman problem
instance of	c/Computational hardness assumptions