Shor's Algorithm Forces Global Encryption Overhaul — SkimNews
Get the Health newsletter
Daily health & science — research, biotech, public health, the studies worth knowing. Free.
- Peter Shor developed his factoring algorithm in 1994 at Bell Labs after attending a seminar by quantum computing pioneer Umesh Vazirani, creating what became the strongest argument for actually building quantum computers.
- Shor's algorithm could let a sufficiently powerful quantum computer defeat most modern encryption, which relies on the difficulty of factoring very large numbers protecting emails, medical files, and bank transactions.
- Shor told the Quantum.Tech World conference in Boston that he isn't worried because post-quantum cryptography methods exist and NIST has already established quantum-proof encryption standards — but warned implementation will be "incredibly hard."
- Google is targeting 2029 to complete its migration to post-quantum cryptography, and President Trump signed an executive order requiring US government high-value and high-impact systems to do the same by 2031.
- Shor said current quantum computers are "still toys" but will "stop being toys very soon," praising recent progress in scaling hardware and error correction.
- Shor believes useful quantum applications are narrow — simulating quantum systems for chemistry and biomedicine, plus optimization problems — and said quantum computers won't predict the stock market.
- Shor acknowledged no one has matched his algorithm's impact, saying he suspects researchers are "either not smart enough" to find more great quantum algorithms, or that quantum computers simply aren't useful for all that many tasks.
Why it matters: Banks and hospitals may need years just to audit their networks before updating devices and software to post-quantum cryptography — yet Google is already targeting 2029 for its own migration, and Trump's executive order sets a 2031 deadline for high-value US government systems.
Ask SkimNews
