Computational Diffie-Hellman assumption
GPTKB entity
Statements (19)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:cryptographic_assumption
|
| gptkbp:abbreviation |
gptkb:CDH_assumption
|
| gptkbp:category |
gptkb:computational_hardness_assumption
|
| gptkbp:formedBy |
1976
|
| gptkbp:isWeakerThan |
gptkb:Decisional_Diffie-Hellman_assumption
Discrete logarithm assumption |
| gptkbp:namedAfter |
gptkb:Martin_Hellman
gptkb:Whitfield_Diffie |
| gptkbp:relatedTo |
gptkb:Discrete_logarithm_problem
gptkb:Diffie-Hellman_key_exchange |
| gptkbp:state |
Given g, g^a, g^b in a cyclic group, it is hard to compute g^{ab}.
|
| gptkbp:usedIn |
gptkb:elliptic_curve_cryptography
public-key cryptography key exchange protocols |
| gptkbp:bfsParent |
gptkb:CDH_assumption
gptkb:Decisional_Diffie-Hellman_assumption gptkb:Diffie-Hellman_assumption |
| gptkbp:bfsLayer |
7
|
| https://www.w3.org/2000/01/rdf-schema#label |
Computational Diffie-Hellman assumption
|