Category
page 1Computational hardness assumptions
integer factorization
decomposition of a number into a product
discrete logarithm
problem of inverting exponentiation in finite groups
security level
measure of cryptographic strength
Diffie–Hellman problem
problem in cryptography
exponential time hypothesis
unproven computational hardness assumption that 3-SAT isn’t solvable in subexponential time in the worst case
RSA problem
Computational hardness assumption
computational hardness assumption
hypothesis in computational complexity theory
Logjam
security vulnerability against a Diffie–Hellman key exchange ranging from 512-bit to 1024-bit keys, publicly reported on 20 May 2015