Google’s Quantum Crypto Paper Tells You Quite a Lot
Google’s recent paper reveals that Shor’s algorithm can potentially break the cryptography used by Bitcoin and Ethereum with fewer than 500,000 qubits. The paper discloses significant architectural details, suggesting that reproducing similar circuits is feasible for well-resourced quantum research teams. However, the actual hardware needed for an attack remains a substantial barrier.
- Google's paper shows Shor's algorithm could break Bitcoin/Ethereum's 256-bit ECC with under 500,000 physical qubits in about nine minutes—roughly Bitcoin's block time.
- Even though Google withheld exact circuit details, the disclosed architecture (kickmix design, modular inversion, ~2.7 million non-Clifford gates per point addition) gives skilled teams enough to replicate similar circuits within months.
- Goertzel estimates a small expert team could reproduce circuits within 2-3x Google's efficiency in 6-12 months, and even a 2x-worse circuit would still threaten current cryptography.
- The real barrier isn't algorithmic knowledge but building the actual hardware, though well-funded labs or defense contractors could plausibly pursue it.
Google's recent 57-page whitepaper reveals that Shor's algorithm can potentially compromise the 256-bit elliptic curve cryptography used by Bitcoin and Ethereum. The paper indicates that with fewer than 500,000 physical qubits on a superconducting architecture, a quantum circuit can break this encryption in about nine minutes, coinciding with Bitcoin's average block time. Despite withholding the specific circuit details for responsible disclosure, the paper provides enough architectural information that skilled quantum algorithm teams could replicate similar circuits. Ben Goertzel, CEO of SingularityNET, believes that even his team, which doesn't focus primarily on quantum computing, could produce comparable circuit designs.
The paper outlines significant architectural details, including the use of kickmix architecture, modular inversion techniques, and specific gate counts for elliptic curve point addition. For instance, the paper mentions that the circuits involve around 2.7 million non-Clifford gates for each point addition subroutine. The optimizations discussed are not groundbreaking but demonstrate a notable improvement over previous work, achieving about an order of magnitude better efficiency than earlier designs. Goertzel estimates that a small team of experts could reproduce circuits within 2-3 times Google's efficiency in six to twelve months, given the readily available knowledge in the field.
While Google's specific implementation remains undisclosed, the optimizations mentioned are well-documented in existing literature. Goertzel points out that the last stages of optimization require sophisticated scheduling and decision-making, which is where Google’s resources provide a competitive advantage. However, even if a circuit requires double the gates, it still poses a significant threat to current cryptographic systems. The implications are clear: any well-funded research group, including national labs and defense contractors, could replicate these findings, raising serious concerns about the future of blockchain security.