The main reason to start with Post Quantum Crypto (PQC) right now is because creating strong crypto, good implementation and accepted standards takes very long. Right now, most PQC is in the 'crypto' stage or starting to enter 'implementation' stage.

I'm wondering whether, given recent advances in constructing quantum computers, the PQC initiative will be 'fast enough'.

In particular, I'd like to know if PQC resistant against breaking factoring is widely deployed in practice before...:

  1. Government agencies can efficiently factor using Shor's algorithm
  2. Serious hackers and medium sized companies can factor using Shor.
  3. Script kiddies can run Shor's algorithm

To clarify, I am looking for literature or analyses based on history about deployment speed of cryptographical defenses and compare this with current analysis on the predicted power of quantum computers.

For instance, when will a good lattice based cryptosystem have a 'mainstream' implementation?


closed as primarily opinion-based by Gene, bytebuster, Siong Thye Goh, nj2237, Mithrandir24601 Mar 28 '18 at 8:49

Many good questions generate some degree of opinion based on expert experience, but answers to this question will tend to be almost entirely based on opinions, rather than facts, references, or specific expertise. If this question can be reworded to fit the rules in the help center, please edit the question.

Browse other questions tagged or ask your own question.