Quantum Computing Advances Pose New Threat to RSA Encryption
Recent research suggests a potential acceleration in the timeline for breaking RSA encryption using quantum computers. Whereas fully breaking RSA-2048 still requires significant advancements, a new algorithm combining classical lattice reduction techniques with quantum approximate optimization algorithms (QAOA) dramatically reduces the qubit requirements previously thought necessary.
The Shrinking Qubit Requirement
For decades, breaking RSA encryption with a quantum computer was considered a distant threat, requiring millions of qubits. Shor’s algorithm, the standard for quantum factorization, necessitates substantial computational power. However, a group of Chinese researchers has published findings indicating that RSA-2048 could be challenged with a quantum circuit requiring only 372 physical qubits [1]. This is a significant reduction, bringing the possibility within reach of current and near-future quantum computing technology. For context, IBM’s Osprey quantum computer already boasts 433 qubits [1].
How the New Algorithm Works
The researchers achieved this reduction by combining classical lattice reduction factoring techniques with a quantum approximate optimization algorithm (QAOA). This hybrid approach lowers the computational burden on the quantum component, making it feasible with fewer qubits. The team demonstrated the algorithm’s potential by successfully factoring 48-bit numbers using a 10-qubit quantum computer [3]. While scaling this up to 2048 bits presents challenges, experts note no obvious theoretical barriers [1].
Implications for Cryptography
The potential to break RSA encryption has significant implications for cybersecurity. RSA and Diffie-Hellman are widely used public-key algorithms that secure a vast amount of internet communication and data. A successful attack would compromise the confidentiality and integrity of this data. Bruce Schneier, a leading cryptography expert, acknowledges the seriousness of the research, stating it is “something to take seriously” [1].
NIST’s Post-Quantum Cryptography Standardization
Recognizing the long-term threat posed by quantum computers, the National Institute of Standards and Technology (NIST) has been running a Post-Quantum Cryptography (PQC) Standardization Competition to identify and standardize new cryptographic algorithms resistant to attacks from both classical and quantum computers [2]. This proactive effort aims to ensure a smooth transition to quantum-resistant cryptography before quantum computers become powerful enough to break current encryption standards.
Challenges and Future Outlook
Despite the progress, significant engineering challenges remain in building and scaling quantum computers capable of breaking RSA-2048. The Chinese researchers’ work doesn’t immediately render RSA obsolete, but it accelerates the need for transitioning to post-quantum cryptographic algorithms. The lack of classification of this research by the Chinese government also raises questions, as noted by Bruce Schneier [1].
While quantum computing remains a complex field with many hurdles, the recent advancements underscore the importance of continued research and development in post-quantum cryptography to safeguard digital security in the years to come.