How Classical Cryptography Will Survive Quantum Computers
nautil.us
nautil.us
The idea here is to use so-called Quantum Key Distribution where photons are transmitted over a physical line and the laws of physics guarantee its security.
But there's a problem (ok, there are many problems): Quantum Key Distribution relies on an authenticated channel that is simply assumed to already exists. How do you get that authenticated channel? Nobody knows.
(Apart from that QKD would be hugely expensive, wouldn't work over wifi or mobile connections and would have pretty severe distance limits, which all make a "Quantum Internet" a ridiculous enterprise - but the authenticated channel really kills the whole thing as a solution for Quantum Computer attacks.)
It does already exist, there are several quantum networks already. Though, there are also signs that the first generation may have technological issues. And the entire benefit is that using it will allow you to detect if the channel is authenticated, it does nothing to ensure that it is.
[0]: at page 177 in http://researcher.watson.ibm.com/researcher/files/us-bennetc...
Isn't the whole point of these channels that you can detect anyone in the middle? You don't need to assume there's a good channel, you can tell while using it. Perhaps I'm misremembering though, it's been a while since I did this.
> In April 2017, the National Institute of Standards and Technology followed suit, starting a public vetting process lasting 4 to 6 years.
PDF: http://nvlpubs.nist.gov/nistpubs/ir/2016/NIST.IR.8105.pdf
April 2016 report announcement: https://www.nist.gov/news-events/news/2016/04/nist-kicks-eff...
Edit to add: In the above, I don't see mention of the public vetting process (my search fu is probably weak today). I would be interested in seeing the release of the ongoing commentary and proceedings.
1. The lattice approaches: NTRU and particularly LWE, which is the simplest of the PQ schemes to get your head around: LWE proposes a linear algebra problem that could be trivially solved through elimination, perturbed with errors that explosively increase the complexity of recovering the unknowns.
2. Isogenies, which you can think of as higher-order curves, or as a way of doing what we do today with elliptic curve points using entire curves (and the mappings between them) instead.
LWE was briefly deployed in Chrome as an experiment.