Discrete Logarithm assumption

GPTKB entity

Statements (32)
Predicate Object
gptkbp:instanceOf cryptographic assumption
gptkbp:appliesTo elliptic curve groups
multiplicative group of integers modulo p
gptkbp:attackKnownAs gptkb:Pollard's_rho_algorithm
baby-step giant-step algorithm
index calculus method
gptkbp:basisFor discrete log-based cryptosystems
gptkbp:contrastsWith RSA assumption
integer factorization assumption
gptkbp:dependsOn group structure
group size
gptkbp:formedBy gptkb:Martin_Hellman
gptkb:Whitfield_Diffie
1976
https://www.w3.org/2000/01/rdf-schema#label Discrete Logarithm assumption
gptkbp:implies security of many cryptographic protocols
gptkbp:isWeakerThan gptkb:Decisional_Diffie-Hellman_assumption
gptkb:Computational_Diffie-Hellman_assumption
gptkbp:notProven gptkb:NP-hard
NP-complete
gptkbp:relatedTo modular arithmetic
finite cyclic group
computational hardness
gptkbp:state computing discrete logarithms is hard
gptkbp:usedIn gptkb:DSA
gptkb:Schnorr_signature
gptkb:ElGamal_encryption
gptkb:Diffie-Hellman_key_exchange
public-key cryptography
gptkbp:bfsParent gptkb:CDH_assumption
gptkb:Decisional_Diffie-Hellman_assumption
gptkbp:bfsLayer 7