Skip to content

Post Quantum Panic: When Will the Cracking Begin, & Can We Detect It?

Konstantinos Karagiannis

Analyzes algorithmic breakthroughs in Shor's algorithm, hardware roadmaps for cryptographically relevant quantum computers, and methods to detect quantum attacks.

Summary

Timelines for Cryptographically Relevant Quantum Computing

NIST standards and organizational roadmaps often target 2035 for completing post-quantum cryptography (PQC) migrations. However, accelerated advances in quantum hardware and theoretical algorithms suggest that cryptographically relevant quantum computers (CRQCs) could emerge significantly earlier.

Algorithmic Advancements in Factoring

Algorithmic optimizations, such as Oded Regev's multidimensional lattice modifications to Shor's algorithm, substantially reduce the number of logical qubits required for integer factoring and discrete logarithm computation. These breakthroughs accelerate the timeline for cracking RSA and elliptic curve cryptography (ECC).

Hardware Scaling and Fault Tolerance

Commercial quantum developers are tracking aggressive roadmaps targeting thousands of physical qubits and early fault-tolerant logical qubits before 2030. These developments compress the available window for enterprise cryptographic migration.

Detecting Unauthorized Quantum Computation

Defenders and cloud quantum service providers can monitor quantum circuit execution patterns, gate depth anomalies, and suspicious API call volumes to detect adversarial attempts to execute cryptanalytic algorithms on cloud-hosted quantum processors.

Related talks