Computational hardness assumptions

decomposition of a number into a product

problem of inverting exponentiation in finite groups

measure of cryptographic strength

problem in cryptography

unproven computational hardness assumption that 3-SAT isn’t solvable in subexponential time in the worst case

Computational hardness assumption

hypothesis in computational complexity theory

security vulnerability against a Diffie–Hellman key exchange ranging from 512-bit to 1024-bit keys, publicly reported on 20 May 2015