Diffie-Hellman encryption, also known as "Diffie-Hellman key exchange", relies on the [[fundamentalism|fundamental]] [[hardness|difficulty]] of [[computing]] the discrete logarithm ''g<sup>a</sup>'' of a number ''x'' in the [[group]] ''G''. It was invented by [[Whitfield Diffie]] and [[Lillian Hellman]] in 1976. The protocol proceeds in three steps:
+
Diffie-Hellman encryption, also known as "Diffie-Hellman key exchange", relies on the fundamental [[hardness|difficulty]] of [[computing]] the discrete logarithm ''g<sup>a</sup>'' of a number ''x'' in the [[Group (mathematics)|group]] ''G''. It was invented by [[Whitfield Diffie]] and [[Lillian Hellman]] in 1976. The protocol proceeds in three steps:
# Alice and Bob secretly decide on a large prime number ''p'' and a group ''G'' in which to work, with [[generator]] ''g''.
# Alice and Bob secretly decide on a large prime number ''p'' and a group ''G'' in which to work, with [[generator]] ''g''.