Shor’s 1990s Algorithm Threatens Internet Encryption, Raising Costly Quantum-Proof Shift
Updated
Updated · New Scientist · Jul 12
Shor’s 1990s Algorithm Threatens Internet Encryption, Raising Costly Quantum-Proof Shift
3 articles · Updated · New Scientist · Jul 12
Summary
Peter Shor’s algorithm, devised in the 1990s, remains the clearest example of how a powerful quantum computer could crack the encryption that underpins internet security.
That threat has sharpened concern over quantum-proof standards because replacing vulnerable systems would be slow and expensive, especially across sprawling communications networks.
Banks and hospital systems may need years to audit where encryption is exposed, then years more to update devices and software tied to those weak points.
Shor’s work helped turn quantum computing from an obscure research field into one with direct implications for governments, companies and critical digital infrastructure.
Is your sensitive data, stolen today, already a ticking time bomb for future quantum hackers?
With a $2 trillion price tag, is the global race to upgrade our digital defenses creating more immediate risks than the future quantum threat?
The Quantum Deadline: Why Organizations Must Migrate to Post-Quantum Cryptography Before 2030
Overview
Rapid advancements in quantum computing are causing a major shift in cybersecurity. The urgency for organizations to adopt post-quantum migration strategies has increased because recent assessments show that the timeline for achieving a Cryptographically Relevant Quantum Computer (CRQC) is accelerating. Critical milestones toward a CRQC could be reached in less than a year, making the threat from Shor's algorithm—which can efficiently factor large numbers and break widely used encryption like RSA and ECC—an immediate concern. As a result, organizations now have a much shorter window to move to quantum-resistant cryptographic solutions to protect their digital infrastructure.