China demonstrates quantum computer’s ability to break RSA encryption

Chinese researchers use quantum annealing to factor 22-bit RSA key, highlighting future risks to encryption
Photo: POLITICO

Chinese researchers use quantum annealing to factor 22-bit RSA key, highlighting future risks to encryption

Chinese researchers at Shanghai University have achieved a significant milestone in quantum computing by successfully factoring a 22-bit RSA integer using a quantum annealing processor from D-Wave Systems. While this 22-bit key is minuscule compared to the 2048-bit keys used in real-world cryptographic systems, the experiment marks a critical proof of concept. RSA encryption, foundational to global digital security, relies on the computational difficulty of factoring large semiprime numbers—a task that classical computers find increasingly hard as key sizes grow. The Chinese team’s method involved translating the factorization problem into a form suitable for quantum annealing, allowing the quantum machine to efficiently search for solutions by exploiting quantum tunneling. This breakthrough surpasses the previous record of factoring a 19-bit key and demonstrates that quantum approaches can scale to larger, more complex cryptographic challenges. However, experts caution that the leap from 22-bit to 2048-bit encryption is exponential, and current quantum annealers are far from threatening modern RSA standards. Nevertheless, the research highlights the accelerating pace of quantum computing development and its implications for data security. As a result, organizations and governments are being urged to adopt quantum-resistant cryptographic methods and prepare for a future where quantum computers could undermine today’s encryption. Global standards bodies are already rolling out guidelines for post-quantum cryptography, emphasizing the need for proactive security upgrades in anticipation of more powerful quantum attacks.

Leave a Reply

Your email address will not be published. Required fields are marked *