Peter Shor's algorithm has been hailed as a breakthrough in quantum computing, but its creator seems remarkably unbothered by the implications. Speaking at the Quantum.Tech World conference in Boston, Shor downplayed the risks of his 1990s discovery that could potentially break much of the world's digital encryption.
The maths behind it is simple: Shor's algorithm can factor extremely large numbers with ease – a problem conventional computers take an impossibly long time to solve. This underpins modern encryption, used for everything from online banking to sensitive government communications and personal medical records.
So, what happens if a powerful quantum computer were to run Shor's algorithm? It could decrypt vast amounts of secure data, unleashing a global cybersecurity nightmare. But when questioned about this possibility, Shor sounded almost too calm – "We have good methods for post-quantum cryptography, we just have to implement them." He tempered this by admitting it would be an 'incredibly hard' task.
Post-quantum cryptography is the buzzword here – new encryption standards designed to withstand even quantum attacks. It's not just a theoretical concept; institutions like NIST are already working on standardising these methods, which could take years to implement across complex systems.
Large organisations, including major banks and healthcare providers, face an enormous undertaking in auditing their networks, updating hardware, and rewriting software. The pressure is on as quantum computing advances at breakneck speed – while current machines aren't yet powerful enough to execute Shor's algorithm on a large scale, progress is rapid.
Google has set its sights on 2029 for migrating to post-quantum cryptography, and the US government has mandated that high-value systems adopt these new methods by 2031. Shor himself acknowledges this pace of progress – "Quantum computers are no longer toys" – and praises advancements in computational power and error correction techniques.