Quantum computing will break current encryption within a decade

The claim that quantum computers will break RSA and ECC encryption within a decade, necessitating an immediate transition to post-quantum cryptography, sits at the intersection of theoretical computer science, hardware engineering, and cybersecurity policy. The claim bundles three distinct propositions: that quantum algorithms pose a decisive theoretical threat to public-key cryptography, that hardware capable of executing those algorithms at scale will materialize within ten years, and that the urgency of migration is therefore immediate. The available evidence supports the first and third propositions with reasonable confidence but leaves the second—the hardware timeline—substantially uncertain, making the overall assessment balanced rather than decisively favoring either side. The theoretical threat that quantum computing poses to RSA and ECC is mathematically established and not seriously disputed. Shor's algorithm enables a sufficiently powerful quantum computer to factor large integers and solve discrete logarithm problems in polynomial time, reducing the computational effort required to break RSA and ECC from thousands of years on classical hardware to hours or minutes. A university IT security assessment frames this vulnerability as a near-certain future event rather than a speculative one, with the only open question being when hardware will reach the required scale. Recent modeling work has compressed the estimated timeline for a cryptographically relevant quantum computer, suggesting the decade-scale claim is plausible rather than alarmist. Two independent analyses reviewed by New Scientist in 2025 concluded that a quantum computer capable of breaking current encryption may be built significantly sooner than the previously assumed 10-to-20-year window. A separate study modeled the qubit requirements to crack elliptic-curve cryptography used by Bitcoin and Ethereum, finding that fewer than 500,000 physical qubits—substantially below earlier estimates of millions—may suffice to break ECC in minutes. The 'harvest now, decrypt later' threat vector makes the urgency of migration partially independent of the exact hardware arrival date. Adversaries can intercept and store encrypted communications today, then decrypt them retroactively once quantum hardware matures, meaning that data with long-term sensitivity—government secrets, medical records, financial instruments—is already at risk. This vector transforms the debate from a question of when quantum computers will arrive to a question of how long intercepted ciphertext remains sensitive, and for many categories of data the answer is decades. Current quantum hardware remains orders of magnitude below the threshold required to threaten real-world cryptographic keys, and the engineering obstacles separating present machines from cryptographically relevant ones are not merely incremental. Even accepting the revised, lower qubit-count estimates of fewer than 500,000 physical qubits, the gap involves unsolved problems in quantum error correction, qubit coherence times, and fault tolerance at scale—each of which represents a distinct engineering frontier rather than a routine scaling challenge. A cybersecurity firm's assessment concludes that while the quantum threat to public-key encryption is real, it is not imminent, and the ten-year timeline is aggressive given where the hardware actually stands. The claim that quantum computing will 'break current encryption' overstates the threat to symmetric cryptography, which protects the bulk of data at rest. Grover's algorithm provides only a quadratic speedup against symmetric ciphers like AES, a threat that is fully mitigated by doubling key length—for example, moving from AES-128 to AES-256—a step that is already standard practice in many deployments. By conflating the decisive threat to public-key cryptography with the manageable and already-addressed risk to symmetric encryption, the claim inflates the scope of the problem beyond what the evidence supports. The cybersecurity community broadly agrees that the quantum threat to public-key cryptography is genuine and that post-quantum migration should begin now, but the precise hardware timeline—whether ten years or twenty—remains the critical unresolved variable. NIST has already finalized post-quantum cryptographic standards based on lattice-based, code-based, and hash-based schemes, providing a credible and concrete migration path before quantum hardware matures. The existence of standardized alternatives means the risk is manageable if organizations begin transitioning promptly, but the operational complexity and cost of migrating large-scale cryptographic infrastructure should not be underestimated. The claim's three components carry different confidence levels: the theoretical vulnerability of RSA and ECC is near-certain, the urgency of beginning migration is broadly endorsed, but the specific ten-year hardware timeline is the weakest link in the argument. Recent research lowering qubit-count estimates does compress the timeline, but the same reporting acknowledges that current hardware remains far below even the revised threshold, leaving the gap between modeling projections and engineering reality unresolved. The 'harvest now, decrypt later' vector introduces a temporal asymmetry that partially decouples the policy question from the hardware question: even if quantum computers arrive in fifteen or twenty years, data intercepted today with multi-decade sensitivity is already exposed. This means the call for immediate migration retains force even under the more conservative hardware timelines favored by skeptics, though the degree of urgency scales with the sensitivity and lifespan of the data in question. The evidence base, while structurally complete across the main lines of argument, has notable limitations that constrain the confidence of any timeline-specific conclusion. The pro-side timeline evidence relies primarily on news reports of modeling studies rather than the underlying peer-reviewed papers themselves, making it difficult to assess the assumptions, error bars, and boundary conditions of the qubit-count estimates. The con-side argument about symmetric encryption draws its evidence from a community discussion forum rather than a technical source, weakening what is otherwise a logically sound point. No evidence in the bundle addresses the pace of investment, the state of classified quantum programs, or the potential for algorithmic breakthroughs that could further reduce hardware requirements—all of which are material to the timeline question. The absence of direct peer-reviewed hardware roadmaps or government intelligence assessments means the timeline debate is being adjudicated largely through secondary reporting and expert opinion rather than primary technical data. The evidence supports the claim's core premise—that quantum computers will eventually break RSA and ECC and that migration to post-quantum cryptography should begin now—but does not substantiate the specific assertion that this will occur within a decade with sufficient confidence to treat it as a settled forecast. The theoretical vulnerability of public-key cryptography to Shor's algorithm is mathematically certain, and the 'harvest now, decrypt later' threat vector makes the case for immediate action logically compelling regardless of the exact hardware timeline. However, the ten-year hardware timeline is the claim's weakest component: recent modeling compresses prior estimates but current machines remain orders of magnitude below the required threshold, and the engineering challenges of error correction and fault tolerance at scale are not yet solved. The claim also overstates the scope of the threat by implying that all current encryption is at risk, when symmetric ciphers like AES-256 are not meaningfully threatened by known quantum algorithms. The dominant uncertainty driver is the hardware timeline, which depends on engineering breakthroughs that cannot be reliably forecast; the dominant confidence driver is the expert consensus that the threat is real and that NIST-standardized post-quantum alternatives exist. On balance, the claim is partially supported: the call for migration is well-founded, but the ten-year deadline and the blanket framing of 'all encryption' are not adequately supported by the available evidence.