Every password you have ever set, every encrypted message you have ever sent, and every secure transaction you have ever made relies on a mathematical problem that classical computers find essentially impossible to solve: factoring very large numbers into their prime components. A sufficiently powerful quantum computer could solve that problem in hours. The encryption protecting your bank account, your medical records, and every government secret on Earth would become worthless.
This is not science fiction. It is a well-understood mathematical reality, and it has governments, cryptographers, and intelligence agencies moving faster than at any point in the history of encryption standards. The question is not whether quantum computers will eventually crack current encryption. The question is when and whether the world can transition to quantum-resistant cryptography before that moment arrives.
Why Quantum Computers Break Encryption: The Math Behind the Threat
Modern public-key cryptography, the system that protects the vast majority of internet traffic, relies on a simple asymmetry. Multiplying two large prime numbers together is trivially easy. Factoring the result back into its two prime components is computationally infeasible for classical computers when the numbers are large enough. RSA-2048, the most widely used encryption standard, uses numbers with 617 digits. The best known classical algorithm would take longer than the current age of the universe to factor it.
In 1994, mathematician Peter Shor published an algorithm for quantum computers, now called Shor's Algorithm, that can factor large numbers exponentially faster than any classical method. On a quantum computer with enough reliable qubits, Shor's Algorithm reduces the factoring problem from computationally infeasible to tractable in hours or days.
The same vulnerability applies to Elliptic Curve Cryptography (ECC), which is used in most modern digital signatures and key exchange protocols, including those securing HTTPS connections, WhatsApp messages, and Bitcoin wallets. Shor's Algorithm breaks ECC too.
Symmetric encryption, like AES-256, faces a different and less severe threat from quantum computers. Grover's Algorithm effectively halves the security level, meaning AES-256 would provide roughly the security equivalent of AES-128 against a quantum adversary. For most applications, this is manageable with a key size upgrade. The existential threat applies specifically to public-key systems. For a broader look at how quantum mechanics reshapes computing at the hardware level, the quantum revolution reshaping computing article provides the foundational context.
The Timeline: When Could This Actually Happen?
Building a quantum computer capable of running Shor's Algorithm against RSA-2048 requires on the order of 4,000 error-corrected logical qubits running millions of quantum gate operations with high fidelity. Current quantum computers have hundreds to thousands of physical qubits, but physical qubits are noisy and error-prone. Converting physical qubits into reliable logical qubits through error correction requires roughly 1,000 physical qubits per logical qubit, meaning a cryptographically capable quantum computer would need millions of physical qubits operating with sustained precision.
The most credible expert estimates, from the Global Risk Institute's annual Quantum Threat Timeline survey, suggest a greater than 50% probability that RSA-2048 will be breakable by the mid-2030s. US government agencies including NIST and NSA have issued warnings that Q-Day, the moment when a cryptographically relevant quantum computer exists, could arrive as early as 2030, particularly if a hardware breakthrough accelerates development.
In 2024, Google demonstrated an important milestone with its Willow processor, showing that adding more error correction actually reduced errors rather than compounding them, a critical threshold that had eluded researchers for years. IBM has announced plans to achieve 200 reliable logical qubits by 2029, capable of performing over 100 million quantum operations. These are not the numbers needed to break RSA-2048, but they represent a trajectory pointing toward it.
The Threat That Is Already Happening: Harvest Now, Decrypt Later
The most urgent aspect of the quantum encryption threat is not about 2030 or 2035. It is happening now.
Nation-state intelligence agencies are almost certainly conducting what security researchers call "harvest now, decrypt later" attacks: systematically collecting and storing encrypted communications and data today with no attempt to decrypt them immediately. They are warehousing the data until a quantum computer capable of decryption exists, at which point everything collected over the intervening years becomes readable.
NIST, the US Department of Homeland Security, and the European Union Agency for Cybersecurity (ENISA) have all issued formal warnings about this threat vector. The danger is asymmetric: a classified diplomatic cable encrypted today and intercepted today might be worth nothing to an adversary who cannot read it. In ten years, if quantum decryption exists, it could be read in full. Sensitive information with long-term value, including state secrets, medical records, financial instruments, and intellectual property, faces real exposure from data that is already being collected.
The question of what happens when entirely new computing paradigms break the security assumptions underlying existing infrastructure connects to a broader pattern examined in the end of passwords and the rise of passkeys article. Authentication is already transitioning away from shared secrets toward cryptographic proof, partly in anticipation of exactly this kind of vulnerability.
NIST Has Already Published the Solution: Post-Quantum Cryptography
The response to the quantum threat is not to wait for quantum computers and then scramble. It is to replace vulnerable cryptographic algorithms with new ones that are mathematically hard for quantum computers to break, even with Shor's Algorithm.
In August 2024, NIST published three Federal Information Processing Standards (FIPS 203, 204, and 205) for post-quantum cryptography. These three standards represent the first generation of quantum-resistant cryptographic algorithms approved for use by US government agencies and, effectively, by the broader internet.
The algorithms are based on mathematical problems that remain hard for quantum computers. CRYSTALS-Kyber (now ML-KEM, FIPS 203) handles key encapsulation, the process of establishing a shared encryption key between two parties. CRYSTALS-Dilithium (now ML-DSA, FIPS 204) handles digital signatures. SPHINCS+ (now SLH-DSA, FIPS 205) provides an alternative signature system based on hash functions rather than algebraic structures.
The US government has directed all federal agencies to complete migration to post-quantum cryptography by 2035. The UK has established a similar roadmap requiring high-priority migrations by 2031 and full transition by 2035. These are not distant targets. The shift from SHA-1 to SHA-2 cryptographic hashing, a far simpler migration, took over 12 years across industries.
Why Migration Is Harder Than It Sounds
Nearly 80% of organizations in recent security surveys report that they only plan to act against the quantum threat once a viable quantum computer actually arrives. This posture is dangerously miscalibrated for two reasons.
First, the harvest-now-decrypt-later threat means the window for protecting long-lived sensitive data has already partially closed. Data encrypted today under RSA or ECC and intercepted today is already a quantum decryption target.
Second, cryptographic migration is slow. It requires inventorying every system that uses encryption, including certificates, key exchange protocols, digital signatures, VPNs, secure email, database encryption, IoT devices, and embedded systems. Many of these systems are difficult or impossible to update remotely. Critical infrastructure such as power grids, financial clearing systems, and medical devices often runs on hardware and software that cannot be patched quickly. The moment when AI can design its own successor involves a similar temporal asymmetry: the implications of a capability threshold arrive before institutions are prepared to govern them.
A Comparison of Quantum-Vulnerable vs. Quantum-Resistant Algorithms
| Algorithm | Type | Quantum Threat | Replacement |
|---|---|---|---|
| RSA-2048 | Public-key encryption | Broken by Shor's Algorithm | ML-KEM (CRYSTALS-Kyber) |
| ECC (P-256, P-384) | Digital signatures / key exchange | Broken by Shor's Algorithm | ML-DSA (CRYSTALS-Dilithium) |
| AES-128 | Symmetric encryption | Weakened by Grover's Algorithm | AES-256 (key size upgrade) |
| AES-256 | Symmetric encryption | Marginally weakened | Retain with monitoring |
| SHA-256 | Cryptographic hash | Marginally weakened | SHA-384 or SHA-512 |
What Happens to Bitcoin and Blockchain?
Cryptocurrency represents one of the more interesting edge cases in the quantum encryption threat. Bitcoin and most blockchain systems use Elliptic Curve Digital Signature Algorithm (ECDSA) for transaction signing, directly vulnerable to Shor's Algorithm. A quantum computer powerful enough to break RSA-2048 could in principle forge digital signatures and redirect transactions on these networks.
The Bitcoin network has no central authority to mandate an algorithm upgrade. Migration to quantum-resistant signatures would require near-universal consensus across a decentralized network of participants, each with their own incentives. This is a governance problem at least as much as a technical one. Several blockchain projects are already developing quantum-resistant signature schemes, but adoption timelines remain unclear.
Conclusion
The quantum computing threat to encryption is real, technically well-understood, and on a timeline that demands action now rather than at the point of crisis. The mathematics is not uncertain. Shor's Algorithm demonstrably breaks RSA and ECC encryption on a sufficiently powerful quantum computer. The uncertainty is in the hardware: when will a machine with enough reliable logical qubits actually exist?
The most credible expert estimates place a greater than 50% probability of that machine existing by the mid-2030s. The harvest-now-decrypt-later threat is already active. NIST has published the quantum-resistant standards. The 2035 migration deadline exists. The question is whether organizations and governments will treat this as the infrastructure transformation it actually is, or wait until urgency is forced on them by a capability that arrives without announcement.
The most dangerous moment in a cryptographic transition is not when the threat arrives. It is the window between when the threat becomes credible and when the migration is complete. That window is open right now.
Frequently Asked Questions
Can quantum computers really break all encryption?
Quantum computers can break public-key systems such as RSA and ECC using Shor's Algorithm. Symmetric encryption like AES-256 is weakened but remains practical with larger keys.
When will quantum computers be able to break RSA-2048?
Expert surveys place a greater than 50% probability by the mid-2030s, with 2030 cited as a possible early boundary. Estimates shift as hardware progress changes.
What is post-quantum cryptography?
Post-quantum cryptography refers to algorithms secure against quantum attacks. NIST standardized ML-KEM, ML-DSA, and SLH-DSA in 2024 for key exchange and signatures.
What is the harvest now, decrypt later threat?
Adversaries collect encrypted data now and store it for future quantum decryption. Agencies like NIST and ENISA warn this already threatens long-lived data.
Does the quantum threat affect passwords specifically?
The threat targets the cryptography behind TLS and digital signatures, not passwords directly. If those systems are broken, attackers can impersonate servers and intercept traffic.
What should organizations do to prepare for quantum threats?
Inventory where RSA and ECC are used, build crypto-agility, and start migrating critical systems to NIST post-quantum standards. The 2035 deadline is a latest date, not a starting point.
Is AES-256 safe from quantum computers?
Grover's Algorithm reduces AES-256's effective strength to about 128 bits, which remains infeasible to brute-force. AES-128 should be upgraded, while AES-256 remains acceptable.