Security, Math, Cryptography.
relies on mathematical problems that admit no efficient solution (yet), so that computing f(x) is easy while finding x from f(x), without knowing the trapdoor is considerated hard. RSA RSA’s trapdoor function is written as exponentiation modulo a composite number and is related to the problem of