Get the latest tech news
Cryptographers Are Discovering New Rules for Quantum Encryption
Researchers have proved that secure quantum encryption is possible in a world without hard problems, establishing a new foundation for what is needed to keep information secure.
Bit commitment and all other cryptographic protocols rely on problems in a class that complexity theorists call “NP,” whose defining feature is that it’s easy to check whether a candidate solution is correct. The 2021 paper came out of Kretschmer’s struggle to understand a specific version of a problem that sounds conceptually straightforward: How hard is it to distinguish, or discriminate between, two quantum states that look superficially similar? Fermi Ma (left), John Wright (center), and Alex Lombardi proved that quantum cryptography could still be secure even with an oracle that could instantly solve any computational problem that had classical inputs.
Or read this on Wired
