If solved
Provably Secure Encryption
Encryption whose security rests on a mathematical proof instead of unproven assumptions.
Open in the interactive tree →Today's schemes (RSA, elliptic curves, lattices) are considered secure because nobody has broken them yet, not because it is proven. If P is not NP is proven and one-way functions can be shown to exist, cryptography would for the first time come with a guarantee.
What it brings
- Encryption without reliance on unchecked assumptions
- Long-term secrecy of archives and health data without fear of mathematical breakthroughs
- Legal certainty for digital identity and signatures