Computational Diffie–Hellman assumption
The computational Diffie–Hellman (CDH) assumption is a computational hardness assumption about the Diffie–Hellman problem.The CDH assumption involves the problem of computing the discrete logarithm in cyclic groups. The CDH problem illustrates the attack of an eavesdropper in the Diffie–Hellman key exchange protocol to obtain the exchanged secret key.
Wikipage disambiguates
Wikipage redirect
primaryTopic
Computational Diffie–Hellman assumption
The computational Diffie–Hellman (CDH) assumption is a computational hardness assumption about the Diffie–Hellman problem.The CDH assumption involves the problem of computing the discrete logarithm in cyclic groups. The CDH problem illustrates the attack of an eavesdropper in the Diffie–Hellman key exchange protocol to obtain the exchanged secret key.
has abstract
The computational Diffie–Hellm ...... tain the exchanged secret key.
@en
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
983,397,711
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
comment
The computational Diffie–Hellm ...... tain the exchanged secret key.
@en
label
Computational Diffie–Hellman assumption
@en