NoParrot NoParrot
Back to AI Fact Checks

Is quantum computing about to break all encryption?

NoParrot Fact Check · August 22, 2026

Fact-checked by NoParrot's 4-model methodology · Last verified August 22, 2026

Want to fact-check your own claim? Try NoParrot Free
50

NoParrot Score

Mostly consistent

Claim breakdown

Verified
1
Uncertain
2
Disputed
0

Synthesis

No, quantum computing is not about to break all encryption overnight, though it poses a serious long-term threat to today’s public-key cryptography. A transition to quantum-resistant cryptographic methods is already underway and is expected to be completed over the coming years.

Practical attacks on public-key algorithms such as RSA and ECC, which are vulnerable to Shor's algorithm for solving discrete logarithms and factoring, would require millions of logical or physical qubits for error correction. Such large-scale, fault-tolerant quantum computers do not currently exist and are still many years away.

Symmetric encryption, like AES, and hash functions are generally considered more resistant, as Grover's algorithm offers only a quadratic speedup that can be offset by using larger key sizes; for example, AES-256 remains strong. Most data encrypted at rest with strong symmetric keys remains secure, though adversaries might collect encrypted data today to decrypt in the future once quantum computers mature, especially for information needing long-term secrecy. Estimates for cryptographically relevant quantum computers range from 10–30 years, depending on hardware progress, and new quantum-resistant algorithms like ML-KEM/Kyber and ML-DSA/Dilithium are being standardized to mitigate these future risks.

What each model said

  • Grok ✓ 3 ⚠ 2
    No. Current quantum computers lack the scale, stability, and error correction needed to break widely used public-key encryption like RSA or ECC. Shor's algorithm could theoretically factor large numbers, but practical attacks require millions of logical qubits; existing systems have only hundreds of noisy physical qubits. Symmetric encryption such as AES remains secure against foreseeable quantum threats, as Grover's algorithm offers only a quadratic speedup that larger keys can offset. NIST is standardizing post-quantum algorithms to replace vulnerable schemes. Estimates for cryptographically…
  • Claude ✓ 3 ⚠ 2
    No, quantum computing is not about to break all encryption. This claim is significantly overstated. Here's the reality: **What quantum computers threaten:** - **RSA and ECC** (the public-key cryptography securing most internet traffic, digital signatures, and key exchange) are vulnerable to **Shor's algorithm**, which can factor large numbers and solve discrete logarithms efficiently. - This is a genuine, well-understood mathematical threat. **What they don't seriously threaten:** - **Symmetric encryption** (like AES) is largely safe. Grover's algorithm only provides a quadratic speedup, effec…
  • GPT ✓ 3 ⚠ 1
    No. Quantum computing is not about to break all encryption. What is true: - **RSA, Diffie-Hellman, and elliptic-curve cryptography** would be breakable by a sufficiently large, fault-tolerant quantum computer using **Shor’s algorithm**. - Such machines **do not currently exist** at the required scale. - **Symmetric encryption** like **AES** is much less affected. Quantum attacks using Grover’s algorithm give a speedup, but larger key sizes compensate; **AES-256 remains considered strong**. - **Hash functions** like SHA-256 are also not “broken,” though security margins can be reduced by quantu…
  • Gemini ✓ All verified
    No, quantum computing is not about to break all encryption. While quantum computers, if they reach sufficient scale and stability, could break certain widely used public-key encryption algorithms (like RSA and ECC) through algorithms like Shor's, current quantum computers are not powerful enough to do so. They lack the necessary number of stable qubits and error correction capabilities. Research and development in "post-quantum cryptography" (PQC) or "quantum-resistant cryptography" are actively underway to develop new cryptographic standards that are secure against quantum attacks. Organizati…

Models Used

  • Grok
  • Claude
  • GPT
  • Gemini

Disclaimer: This page summarizes the output of 4 frontier large-language models at a single point in time. NoParrot Score reflects cross-model consensus, not absolute truth. Models can be wrong, and consensus can be wrong with them. Treat this page as a research aid, not a final verdict.

Related Questions

Check your own claim

Send any question to 4 AI models at once. See where they agree and where they don't — with a NoParrot Score from 0 to 100 and claim-level highlights.

Try NoParrot Free