Ten days. A hundred times less overhead than previously estimated.
That is what one research team now calculates it would take a quantum computer to break 256-bit elliptic curve cryptography — the mathematical foundation securing everything from WhatsApp messages to Bitcoin wallets.
A second team, from Google, delivered an even sharper number: under nine minutes to break the cryptography protecting blockchains, with a 20-fold reduction in required computational resources.
Neither paper has been peer-reviewed. Both arrived in recent weeks. And together, they represent the most concrete evidence yet that Q-Day — the moment a quantum computer can shatter the encryption underpinning modern digital life — is not the distant prospect it once seemed.
What the Researchers Actually Built
The first paper introduces a quantum architecture based on neutral atoms as qubits, the quantum equivalent of classical computing bits. Unlike fixed designs where qubits can only interact with immediate neighbors, neutral-atom qubits can be reconfigured to connect freely with one another. That flexibility, combined with increasingly efficient quantum algorithms, contributes to a dramatic overall reduction in the resources required compared to previous estimates.
Using this approach, the researchers calculated that 256-bit elliptic curve cryptography could be broken in roughly ten days, with 100 times less overhead than previous estimates required.
The Google paper targets a narrower but commercially critical problem: the elliptic curve schemes securing Bitcoin and other cryptocurrencies. Their method cracks that cryptography in under nine minutes, with 20 times fewer resources than prior estimates. The security of cryptocurrency markets rests on the assumption that this kind of attack remains impractical.
Both advances depend on increasingly efficient implementations of Shor’s algorithm — the mathematical proof published by Peter Shor in 1994 demonstrating that quantum computers could break ECC and RSA encryption in polynomial time, specifically cubic time, rather than the exponential time classical machines require.
Why Elliptic Curve Cryptography Matters
ECC is not an obscure academic protocol. It is the load-bearing wall of digital security. The TLS protocol that puts the padlock in your browser depends on it. So do Signal, banking systems, government communications, and the digital signatures that make cryptocurrency transactions verifiable.
If a quantum computer powerful enough to run these attacks becomes practical before the world finishes migrating to post-quantum alternatives — encryption algorithms designed specifically to resist quantum attacks — the consequences would be systemic. Security researchers have warned for years about “harvest now, decrypt later” strategies, in which adversaries collect encrypted data today intending to decrypt it once quantum hardware catches up. Any data encrypted today with ECC could eventually be readable by a machine that does not yet exist but is provably possible to build.
Brian LaMacchia, who led Microsoft’s post-quantum cryptography transition from 2015 to 2022 and now works at Farcaster Consulting Group, cautioned against treating the new papers as a definitive deadline.
“The research community continues to make steady progress on both the physical qubits and the quantum algorithms necessary to realize an efficient and practical CRQC,” LaMacchia said, using the abbreviation for cryptographically relevant quantum computing. “I don’t think either paper gives us a new, hard date for when we’re going to have a practical CRQC (which of course we’ve never had), but they both provide evidence that we are continuing to march down the road to a realizable CRQC and progress toward that goal is not slowing down.”
The Transition Problem
Knowing Q-Day is approaching is not the same as being ready for it. Replacing encryption across the global internet is not a software patch. It requires standards bodies to agree on new algorithms, hardware manufacturers to build support into silicon, software vendors to implement and test those changes, and the vast, fragmented infrastructure of banks, governments, cloud providers, and messaging platforms to deploy everything in coordination.
That process takes years, sometimes decades. Standards bodies have been developing post-quantum algorithms since the mid-2010s, but translating those standards into deployed infrastructure across the global economy is a different order of challenge, and one that moves at nothing like the speed of the research now coming out of quantum computing labs.
The new papers do not specify when a quantum computer capable of these attacks could actually be built. Engineering a utility-scale quantum machine remains an enormous challenge. Theoretical resource reductions do not automatically translate into working hardware.
But the direction of travel is unmistakable. The cost of breaking the internet’s foundational encryption is falling. It is falling faster than expected. And the question is no longer whether Q-Day will arrive, but whether the world will be ready when it does.
Discussion (9)