This is basically a followup-problem of P vs. NP. If you can't show that P!=NP then all attempts to prove the security of a public key crypto algorithm are poi

This is basically a followup-problem of P vs. NP. If you can't show that P!=NP then all attempts to prove the security of a public key crypto algorithm are pointless. Or in other words: The science of provable lower bounds of crypto systems will only start once you solve one of the biggest unsolved problems in mathematics and theoretical computer science. All we have today (and likely for a very long time) is problems we think are hard.