14 Post Quantum Crypto for Dummies These schemes are standardized by various entities, e.g., NIST, ISO, IETF, and BSI. They are considered secure against powerful attacks with conventional computing systems when secure parameters are used. Cryptographic schemes rely on the assumption that certain mathematical or computational problems are hard to solve for an attacker. Many of the cryptographic primitives that we use today are based on the assumption that the integer-factorization problem and the discrete-logarithm problem are hard to solve. This assumption has proven reliable over the recent decades—in case traditional computing systems are used. However, in the mid-1980s, David Deutsch introduced the idea of using the laws of quantum physics for building a new type of computing systems 23, the quantum computer. Quantum Computers A classical computer performs operations on bits that can be in one of the two states »1« or »0« (also called »true« or »false«, »high« or »low«, »on« y x z S “1” “0” Figure 1.1: Representation of a qubit using a Bloch sphere. The state S of the qubit can be any point on the sphere. When the qubit is measured in respect to the z-axis, the state collapses to either »1« (dark gray arrow) or to »0« (light gray arrow). The probability of the result depends on the latitude of the state.
PQC_for_Dummies
To see the actual publication please follow the link above