CHAPTER 1 Quantum Computing Threat 17 by quantum computers are called post-quantum cryptography. Post-quantum cryptography is designed to replace the existing cryptographic primitives and is compatible with existing computing devices and communication systems. Currently, the cryptographic community is discussing several families of primitives for post-quantum cryptography. Each family relies on a different mathematical problem that is believed to be hard to solve even when the attacker has access to a quantum computer. The cryptographic community is investigating which of the proposed approaches is the most efficient and provides the best protection for data and information. However, only few of the proposed alternative schemes are already sufficiently mature for standardization and deployment. Best classical algorithm Age of the universe Number of digits in the number being factorized 1 year 500 1000 1500 2000 1 hour Time to find the factors 1 second Shor’s quantum algorithm 0 Figure 1.2: Shor’s algorithm compared to the best classical algorithm; based on Stolze and Suter, Quantum Computing: A Short Course from Theory to Experiment.
PQC_for_Dummies
To see the actual publication please follow the link above