✓ checked
trust me, bro:
here is the receipt.
the claim
Quantum computers can break 256-bit AES symmetric encryption in practical time.
the verdict
INSUFFICIENT LEANING
Recorded sources
0 sources for · 7 against
Is it true that quantum computers can break 256-bit AES symmetric encryption in practical time?
Unclear. Several peer-reviewed and reference sources indicate that quantum computers threaten public-key cryptography but that Grover's algorithm only halves the effective security of AES-256 to roughly 128 bits, so AES-256 is not practically broken; these sources partially address the claim rather than settling it outright.
Verdict: PARTIAL LEAN · 0 sources for, 7 against · Last checked
Evidence against · 7
Get citation
40-bit encryption. (n.d.). en.wikipedia.org. https://en.wikipedia.org/wiki/40-bit_encryption
See more details
More against · 6
Get citation
Canteaut, A., Duval, S., Leurent, G., Naya-Plasencia, M., Perrin, L., Pornin, T., & Schrottenloher, A. (2020). Saturnin: a suite of lightweight symmetric algorithms for post-quantum security. doi.org. https://doi.org/10.13154/tosc.v2020.iS1.160-207
Get citation
Shiu, H., Yang, C., Tsai, Y., Lin, W., & Lai, C. (2023). Maintaining Secure Level on Symmetric Encryption under Quantum Attack. doi.org. https://doi.org/10.3390/app13116734
Get citation
Olushola, A. & Meenakshi, S. P. (2026). Design and implementation of an authenticated post-quantum session protocol using ML-KEM (Kyber), ML-DSA (Dilithium), and AES-256-GCM. doi.org. https://doi.org/10.3389/fphy.2025.1723966
Get citation
Quantum computing. (n.d.). en.wikipedia.org. https://en.wikipedia.org/wiki/Quantum_computing
Get citation
Security Rests on Three Grounds, and a Quantum Computer Breaks Only One ── RSA at 2048 Bits Is Accelerated by 10^25.3, Yet Multiplying the Key Length by 8 Raises the Quantum Effort Only 512-fold ── What Holds No Information Cannot Be Computed by Any Machine ── [Paper 305]. (n.d.). zenodo.org. https://zenodo.org/records/22172119
Get citation
Accelerating Quantum-Secure Communications via DPU-Based Network Offloads. (2026). research.tue.nl. https://research.tue.nl/en/publications/fde095d5-805e-4fe2-9119-ce56506bc01e
Receipt History
Anyone with this link can read the claim and its public receipt, including any
personal information in that text. Open permanent receipt.
Check your own claim
Challenge the receipt
Requests are recorded for review. This does not start an automatic check
or guarantee a response time.
Citation formatting by citeproc-js (Frank Bennett) and the Citation Style Language project. Source and licenses.
This receipt is an automated verdict against our published method · not an opinion about any author or publication.
Terms · Privacy · How verdicts work
Terms · Privacy · How verdicts work