Cryptographer Filippo Valsorda recently entered into a $5,000 wager with a colleague, centering on when quantum computers will pose a genuine threat to existing encryption standards. The bet underscores a significant gap in how academia and the industry perceive the pace of quantum computing development.
For the past decade, the U.S. National Institute of Standards and Technology (NIST) has been spearheading the development of "Post-Quantum Cryptography" (PQC), with the goal of phasing out algorithms vulnerable to quantum attacks by 2035. However, University of Auckland professor Peter Gutmann remains skeptical. He points out that due to bottlenecks in error-correction technology, current quantum computers cannot even factor a 6-bit number, let alone crack 256-bit elliptic curve encryption.
A Sense of Urgency Sparked by Google Research
A recent report from Google researchers has shifted the expectations of some experts. The study indicates that the number of physical qubits required to solve discrete logarithm problems using Shor's algorithm is about 20 times lower than previously estimated. This finding has prompted tech experts like Valsorda to re-evaluate the risks and call for an accelerated migration of cryptographic systems.
Findings on quantum operational stability released this week by ETH Zurich have further fueled the narrative that quantum computing is on the verge of a breakthrough. While some scholars remain skeptical about the robustness of current quantum research, proponents argue that systems relying on traditional encryption are standing on a "precipice."
This $5,000 bet is more than just a financial wager; it reflects the anxiety within the global cryptographic community as it faces the "superposition" of quantum computing. As tech giants like Google continue to lower the resource thresholds for quantum computing, the debate over the security of our cryptographic infrastructure is shifting from theoretical discussion to urgent engineering reality.