Two independent whitepapers argue that building a utility-scale quantum computer capable of breaking ECC may require far fewer resources than feared. One study demonstrates neutral-atom qubits with nonlocal connectivity and estimates ECC-256 could be cracked in about 10 days with roughly 100x less overhead than earlier projections.
A separate Google-led paper outlines a path to defeat ECC protections used by Bitcoin and other blockchains in under nine minutes, reporting a roughly 20-fold improvement in resource efficiency.
The advances are driven by new fault-tolerant quantum architectures and more efficient Shor’s algorithm variants, which could dramatically speed cryptanalytic tasks once large-scale quantum systems are available. Researchers emphasize that these gains do not remove the need for cryptographic upgrades but do suggest that cryptographically relevant quantum computing (CRQC) is advancing more rapidly than many had expected.
Neither paper has undergone peer review, and experts caution against treating the results as a firm forecast. “The community continues to make steady progress on both hardware and algorithms for CRQC, but there’s no hard date for when a practical system will emerge,” said Brian LaMacchia, a cryptography engineer with a background in post-quantum transition work.
Still, the implications are clear: the crypto landscape faces renewed urgency to accelerate adoption of post-quantum cryptography (PQC) and to diversify cryptographic schemes beyond ECC and RSA, ensuring resilience even as quantum capabilities evolve.
