Quantum Mechanics May Be the New Foundation for Cryptography
In a potential major theoretical breakthrough in cryptography: researchers have developed a quantum-native mathematical framework that could underpin future cryptographic systems, not just defend against quantum attacks.
The classical hard problems (like factoring or discrete logs) are easy for a quantum computer running Shor’s algorithm. Even today’s post-quantum algorithms (like lattice-based or hash-based cryptography) are still grounded in classical computational hardness.
This new paper attempts to create an entirely new hardness paradigm directly from quantum physics—using the structure and behavior of quantum systems themselves as the basis for security. In effect, it’s a “new math” of cryptography that treats quantum mechanics not as a weapon wielded by a potential adversary, but as a potentially stronger foundation to build new cryptographic primitives and protocols.
Why it matters:
- No classical assumptions: If security is based on quantum mechanics itself, it seems more likely to be secure against tomorrow’s quantum adversaries.
- Quantum-native primitives: Protocols are defined within quantum mechanics itself, rather than adapted to tolerate it.
- Wide utility: Could be used to create a wide range of cryptographic (beyond just signatures)
- Theoretically interesting: As an area of research, may illuminate the extent of BQP relative to P and NP, which is an interesting area of complexity theory.
Early ideas that still need iteration, but a good reminder that quantum mechanics isn’t just breaking our old locks. It might be giving us the tools to build new ones.