Elliptic curve crypto may fall to quantum computers sooner

Researchers now estimate that cracking current crypto-security systems may require as few as 500,000 qubits, a reduction by a factor of 20 from previous assessments. This finding significantly shortens the timeline for potential breaches affecting sensitive infrastructure like satellite controls, power grids, and financial institutions.

The work by Ryan Babbush of Google Quantum AI and colleagues reveals that approximately 90% of current crypto-schemes rely on solving complicated polynomial equations based on elliptic curve cryptography, rather than factoring large integers. “Quantum technologies have been thought of as ‘over a decade away’ for a long time,” says Stephanie Simmons, a quantum researcher from Simon Fraser University in Canada, who was not involved in the new research.

Reduced Qubit Count Accelerates Quantum Hacking Threat

The threshold for cracking widely used encryption may be significantly lower than previously thought; new analysis indicates that approximately 500,000 qubits are now estimated to be sufficient to compromise current crypto-security systems, a reduction by a factor of 20 from earlier projections. The team verified the efficacy of their hacking algorithm with a zero-knowledge proof, allowing a cryptographer to independently reconstruct and validate the full algorithm, now publicly available.

This method secures software authentication, electronic passports, and financial transactions for cryptocurrencies like Bitcoin and Ethereum, systems previously thought safe from near-term quantum threats. A classical computer would require billions of years to breach these systems, but Babbush’s team demonstrates a potential quantum shortcut, requiring a superconducting quantum computer with around 500,000 qubits and 80 million gates to complete the operation in under ten minutes.

This speed is concerning because it could jeopardize cryptocurrency transactions that rely on the short-term public sharing of secret codes. Separate research from Oratomic, a quantum computing company, suggests an alternative path to a quantum hack, estimating that 26,000 physical qubits could achieve the same result, though the process would take several days.

Scott Aaronson from University of Texas at Austin acknowledges the findings, stating the results seem reasonable even if all the details haven’t quite been nailed down yet, and notes the improved algorithms appear to accelerate the timeline for a cryptographically relevant quantum computer. Babbush and colleagues urge data managers to migrate to post-quantum cryptography to mitigate this evolving threat, a call Simmons echoes, warning that the publicly known state of the art likely lags behind actual advancements.

Elliptic Curve Cryptography Vulnerability & Algorithm Development

While large-scale quantum computers remain under development, the speed with which these systems could potentially break existing codes is raising concerns across multiple sectors. A crucial, often overlooked detail is that roughly 90% of contemporary crypto-schemes now rely on the complexities of elliptic curve cryptography, rather than the traditional difficulty of factoring large integers. This variance in qubit requirements highlights the influence of quantum computer architecture on hacking speed; Oratomic’s approach utilizes single-atom qubits, which generate fewer errors but operate more slowly than superconducting qubits.