> mathematically proven to be 100% secure We still don't know how to prove the difficulty of any computing problems which the security of conventional cryptosy

> mathematically proven to be 100% secure We still don't know how to prove the difficulty of any computing problems which the security of conventional cryptosystems rely on. https://en.wikipedia.org/wiki/Computational_hardness_assumption https://en.wikipedia.org/wiki/Computational_hardness_assumpt... Some systems, like the one time pad and quantum cryptography have security which doesn't rely on computational hardness, however.