Statements (16)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
cryptographic assumption
|
| gptkbp:category |
computational hardness assumption
|
| gptkbp:formedBy |
cryptographers
|
| gptkbp:fullName |
gptkb:Computational_Diffie-Hellman_assumption
|
| https://www.w3.org/2000/01/rdf-schema#label |
CDH assumption
|
| gptkbp:isWeakerThan |
gptkb:Decisional_Diffie-Hellman_assumption
gptkb:Discrete_Logarithm_assumption |
| gptkbp:relatedTo |
gptkb:Discrete_logarithm_problem
gptkb:Diffie-Hellman_problem |
| gptkbp:state |
Given g, g^a, g^b in a cyclic group, it is hard to compute g^{ab}
|
| gptkbp:usedIn |
gptkb:ElGamal_encryption
gptkb:Diffie-Hellman_key_exchange cryptographic protocols public-key cryptography |
| gptkbp:bfsParent |
gptkb:Computational_Diffie–Hellman_assumption
|
| gptkbp:bfsLayer |
6
|