Google research indicates quantum computers might break RSA encryption earlier than anticipated

Google predicts a million-qubit quantum computer could break RSA encryption in under a week.

: In a breakthrough study, Google researchers led by Craig Gidney have shown that quantum computers could break a 2,048-bit RSA encryption key in just five days using fewer than one million noisy qubits. Previously, this capability was thought to require 20 million qubits, so the new findings signify an enormous leap forward in quantum computing potential. The study involved advancements in quantum algorithms and error correction methods, notably using techniques like yoked surface codes and magic state cultivation. Though these developments bring the reality of a million-qubit machine closer, current machines by IBM and Google can only handle up to 1,121 and 53 qubits, respectively, making further advancements necessary.

Google has revealed a significant advancement in the field of quantum computing, demonstrating that a 2,048-bit RSA encryption key could be cracked in under a week by a quantum computer with fewer than one million noisy qubits. This research, conducted by Craig Gidney, contrasts starkly with previous estimates requiring approximately 20 million qubits. Such revelations have intensified discussions around the future of digital security, particularly the urgency of transitioning to quantum-resistant cryptographic systems.

The breakthrough uses advanced quantum algorithms and enhanced error correction methods. Key strategies include the implementation of approximate modular exponentiation, which reduces the number of logical qubits, alongside enhanced techniques like yoked surface codes and magic state cultivation for denser qubit storage. These innovations considerably lower the required physical resources, setting a more tangible target for researchers and hardware developers.

Despite these strides, the described quantum hardware remains aspirational. Current machines such as IBM's Condor with 1,121 qubits, and Google's Sycamore with 53 qubits, fall far short of the million-qubit threshold needed for practical decryption. This indicates that while the theoretical framework exists, tangible breakthroughs in hardware are still required to realize this potential.

The implications for global security are critical, as systems like RSA underpin secure communications worldwide. The study underscores the potential vulnerabilities inherent in current encryption methods when faced with prospective quantum decryption abilities. Governments and corporates are being urged to adopt post-quantum cryptography to safeguard against future quantum threats. This aligns with the U.S. National Institute of Standards and Technology's recommendation to phase out susceptible systems beyond 2030.

Craig Gidney emphasizes the importance of proactive strategy, highlighting the principle that cryptographic challenges evolve alongside technological progress. This research presents a call to action for policymakers, cryptographic researchers, and hardware designers to expedite the development of quantum-secure systems, aligning with the ongoing advancements in quantum computing capabilities.

Sources: TechSpot, Google, IBM, Quantinuum

SecurityHardwareQuantum Computing