Security of public-key cryptography and hard computational problem
what brings the confidence in security of asymmetric key cryptography? How are we sure that someone knowing the public key can’t determine the corresponding private key? The security relies on three well known hard computational problems.
Adarsh Khare's Blog 