November 28, 2025
Quantum panic, or quantummmm?
Shor's algorithm: the one quantum algo that ends RSA/ECC tomorrow
Quantum apocalypse or clickbait? Shor hailed as crypto killer, commenters yell '21' and 'AI vibes'
TLDR: Shor’s algorithm could break today’s encryption if massive quantum machines existed, but current hardware is far from the millions of qubits required. Commenters mock the doom, citing “21” as the biggest quantum factorization, calling the article AI-flavored, and sharing parody papers—yet reminding this shift still matters
Shor’s algorithm is back in the spotlight with a big claim: if someone builds a huge quantum computer, your internet locks (RSA and ECC—those are the math keys protecting websites, banking, and crypto) are toast. The article leans doomsday—“harvest now, decrypt later”—and the crowd shows up with a mix of panic, eye-rolls, and memes. Skeptics say the scare story ends at reality’s door: we’d need tens of millions of physical “qubits” (quantum bits) to break common encryption, and today we’ve got around a hundred. One commenter bluntly drops the mic: the largest number ever factored by Shor is 21 (proof). Another links a cryptography blog urging folks to ignore flashy factorization records and measure real progress differently (post). Then the meta-drama hits: someone calls the piece LLM-written, roasting its “Grok-like” vibe. And the jokes? Peak snark: a paper titled “Replication… with an 8-bit home computer, an abacus, and a dog” (PDF)—because nothing says “quantum supremacy” like a pet and an abacus. The vibe: half crypto apocalypse, half “calm down, it’s 21”. Meanwhile, a sober thread reminds everyone: post-quantum replacements exist, but adoption takes time—so yes, it’s important, but no, it’s not tomorrow
Key Points
- •Shor’s algorithm efficiently factors integers and solves discrete logarithms, threatening RSA, Diffie-Hellman, and elliptic-curve cryptography.
- •It reframes factoring as a period-finding problem on f(x) = a^x mod N and uses the Quantum Fourier Transform to obtain the period r.
- •If the period r is even, computing gcd(a^{r/2} − 1, N) yields non-trivial factors of N with high probability.
- •The algorithm’s runtime is polynomial, O((log N)^3), compared with sub-exponential classical factoring complexity O(exp(√(log N · log log N))).
- •The article asserts a retroactive threat model: encrypted data (e.g., TLS sessions, cloud backups, Bitcoin keys) stored today could be decrypted later once practical quantum machines run Shor.