| post-quantum cryptography | |
|---|---|
| Name | Post-quantum cryptography |
| Related | Quantum computing, Cryptography, Public-key cryptography |
| Originating institution | National Institute of Standards and Technology |
| Introduced | 2010s |
post-quantum cryptography
Post-quantum cryptography (PQC) comprises cryptographic algorithms designed to resist attacks by quantum computing devices. It matters in the context of Quantum Physics because advances in quantum algorithms and hardware, notably implementations of the quantum Fourier transform and error-corrected quantum computer architectures, threaten widely used public-key cryptography such as RSA and ECC. PQC aims to preserve confidentiality, integrity, and authentication in national and commercial information security infrastructure.
Post-quantum cryptography sits at the intersection of computer science and experimental quantum mechanics research. The field responds to theoretical results in quantum algorithm design, especially Shor's algorithm and Grover's algorithm, and to engineering progress at organizations such as IBM Quantum, Google Quantum AI, IonQ, and Rigetti Computing. Foundational physics work at institutions like MIT, University of Oxford, University of Cambridge, and Caltech informs error models for superconducting qubits and trapped ions. National laboratories including Los Alamos National Laboratory and Lawrence Livermore National Laboratory contribute to assessments of quantum threat timelines, while standards bodies such as the National Institute of Standards and Technology coordinate practical responses.
Quantum algorithms alter classical hardness assumptions used by existing protocols. Shor's algorithm can factor integers and compute discrete logarithms in polynomial time, undermining RSA, Diffie–Hellman key exchange, and ECC. Grover's algorithm quadratically accelerates brute-force search, impacting symmetric-key length considerations for schemes like AES. Research published in venues such as Proceedings of the IEEE and conferences like CRYPTO and Eurocrypt analyze complexity-theoretic implications. Quantum error correction methods developed by researchers including Peter Shor and Daniel Gottesman influence realistic projections of when such algorithms will be practically exploitable.
PQC relies on mathematical problems believed to resist quantum attacks. Major families include: - Lattice-based cryptography (e.g., LWE, Ring-LWE), exemplified by candidates like CRYSTALS-Kyber and CRYSTALS-Dilithium. - Code-based cryptography (e.g., McEliece cryptosystem) with roots in the work of Robert McEliece. - Multivariate cryptography (e.g., Rainbow) based on multivariate quadratic equations. - Hash-based cryptography (e.g., XMSS, SPHINCS+) for digital signatures. - Isogeny-based cryptography (e.g., SIKE) deriving from complex multiplication of elliptic curves.
Standards candidates evaluated during the NIST post-quantum cryptography standardization process illustrate practical instantiations. Companies such as Microsoft and Google have experimented with hybrid deployments combining PQC candidates with existing protocols (e.g., TLS). Academic groups at ETH Zurich, Darmstadt University of Technology, and Ecole Polytechnique continue to advance primitive design and parameter selection.
Practical deployment involves software, hardware, and policy trade-offs. Implementers must consider key sizes, signature lengths, and performance on constrained devices like smartcards and IoT sensors produced by firms such as ARM Holdings. PQC algorithms often demand larger keys and ciphertexts than classical schemes, affecting protocols like SSH, IPsec, and TLS. Side-channel resistance requires countermeasures developed by researchers at École normale supérieure and the University of California, Berkeley. Standards efforts are led by NIST, the Internet Engineering Task Force (IETF), and international organisations like the ETSI. Transition recommendations from national agencies including the US Department of Homeland Security and National Security Agency guide critical infrastructure modernization.
Security proofs for PQC schemes typically reduce scheme security to assumed hard problems such as Shortest Vector Problem (SVP) in lattices or decoding problems in coding theory. Cryptanalysis proceeds through worst-case to average-case reductions, structural attacks, and implementation attacks. Active research by cryptographers at University of Waterloo, Massachusetts Institute of Technology, Weizmann Institute of Science, and companies like Deloitte and KPMG assesses resilience against both classical and quantum adversaries. Conferences such as Asiacrypt and workshops at RSA Conference provide venues for disclosure of vulnerabilities and improvements. Formal methods and provable security frameworks from theorists like Oded Goldreich influence rigorous assessment, while practical break reports prompt parameter updates and algorithm retirements.
Governments view migration to PQC as a matter of national resilience. Policies from entities like NIST and guidance from the National Institute of Standards and Technology's Cryptographic Technology Group set timelines for migration across federal systems. Critical infrastructure sectors—finance, energy, defense—coordinate through organisations such as the Financial Stability Board and national cybersecurity centers. Transition strategies include inventorying cryptographic assets, adopting hybrid schemes, and prioritizing long-lived data that must remain confidential for decades. Public–private partnerships involving Cisco Systems, Amazon Web Services, and telecom operators aim to field test PQC in backbone networks. Education and workforce training at universities and military academies ensure continuity and stability during the transition to post-quantum secure systems.
Category:Cryptography Category:Quantum computing