While modern quantum theory has been utilized for over 100 years, it was not until the 1980s that Paul Benioff first explored the interaction between quantum mechanics and computation.
Since then, quantum computers (QC) have been continually researched by academia, industry, and governments.
In the mid-1990s, Peter Shor published several papers on QC and their potential effect on cryptography. He proposed that a cryptographically relevant quantum computer (CRQC) would break public-key (PKI) systems such as RSA and Diffie-Hellman, which are still used today. A landmark quantum algorithm developed by Peter Shor, which finds prime factors of an integer, has been referred to as Shor’s algorithm ever since.
The goal of post-quantum cryptography (PQC), also called quantum-resistant cryptography (QRC), is to develop cryptographic systems that are secure against both quantum and classical computers and can interoperate with existing communications protocols and networks.
The U.S. government defines a quantum computer in the following way: “The term ‘quantum computer’ means a computer utilizing the collective properties of quantum states, such as superposition, interference, and entanglement, to perform calculations. The foundations in quantum physics give a quantum computer the ability to solve a subset of hard mathematical problems at a much faster rate than a classical (i.e., non-quantum) computer.”
Log in and download the white paper.