Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Computational Diffie–Hellman assumption
open-in-new
<p>The computational Diffie–Hellman (CDH) assumption is a <a href="/facts/Computational_hardness_assumption/ewjpb1I7">computational hardness assumption</a> about the <a href="/facts/Diffie%E2%80%93Hellman_problem/L5C6bEL5">Diffie–Hellman problem</a>. The CDH assumption involves the problem of computing the <a href="/facts/Discrete_logarithm/k8TXh5bL">discrete logarithm</a> in <a href="/facts/Cyclic_group/JL5zfFuL">cyclic groups</a>. The CDH problem illustrates the attack of an eavesdropper in the <a href="/facts/Diffie%E2%80%93Hellman_key_exchange/xR4YQcaD">Diffie–Hellman key exchange</a> protocol to obtain the exchanged secret key. </p>