Introduction
Researchers at Shanghai University [2] [5] [6], led by Wang Chao [1] [3] [4] [7], have made a notable advancement in quantum computing by exploiting vulnerabilities in widely used encryption algorithms, such as RSA and AES, using D-Wave’s advanced quantum annealing systems [4] [7]. This breakthrough demonstrates the potential of quantum machines to address complex cryptographic challenges.
Description
Researchers at Shanghai University in China [6], led by Wang Chao [1] [3] [4] [7], have achieved a significant breakthrough in quantum computing by successfully exploiting vulnerabilities in widely used encryption algorithms, specifically RSA and AES [1], using D-Wave’s advanced quantum annealing systems [4] [7]. They demonstrated a quantum attack on RSA public key cryptography by factorizing the integer 2,269,753, surpassing previous achievements in the field [7]. Their study [1] [3] [4] [6], published in the journal “Computer Science,” introduces a novel quantum annealing algorithm that redefines cryptographic attacks as combinatorial optimization problems [4], utilizing Ising and Quadratic Unconstrained Binary Optimization (QUBO) models [7]. This innovative approach showcases the potential of quantum machines to tackle complex cryptographic challenges, including the factorization of a 50-bit RSA integer [3].
The research extends beyond RSA, targeting algorithms integral to the Advanced Encryption Standard (AES) [4], such as Present, Rectangle [4], and the Gift-64 block cipher [4], all based on the Substitution-Permutation Network (SPN) structure [4]. This marks the first instance where a real quantum computer has posed a substantial threat to widely used cryptographic algorithms [3] [4]. The D-Wave Advantage system [3] [7], which operates near absolute zero and utilizes quantum tunneling [7], has shown promise for public key cryptography applications [7], indicating that quantum annealing may offer significant advantages over traditional quantum algorithms [7], particularly in addressing challenges faced by Noisy Intermediate-Scale Quantum (NISQ) devices [7].
Their paper [2], titled “Quantum Annealing Public Key Cryptographic Attack Algorithm Based on D-Wave Advantage,” details two methods employing quantum annealing techniques. The first method utilizes the D-Wave quantum processor to attack the SPN architecture prevalent in global encryption practices, while the second combines several existing algorithms [1], including the Schnorr signature algorithm and the nearest plane algorithm [1], to enhance computational power and achieve successful decryption [1]. This approach operates with fewer qubits than traditional gate-based quantum computers [6], demonstrating greater efficiency in factoring integers [6].
While this research does not currently threaten modern encryption systems that typically use 2048-bit or 4096-bit keys [6], it highlights the potential for quantum techniques to exploit cryptographic vulnerabilities in ways previously unconsidered [6]. Experts in the information security community have expressed skepticism regarding the practical implications of this research [2]. Rob Joyce [2], former director of cybersecurity at the US National Security Agency [2], described the claims as “totally overblown.” Frederic Jacobs from Apple’s Security Engineering and Architecture team noted that the research does not alter the practical security of RSA encryption [2], suggesting a migration to post-quantum hybrid systems for future-proofing [2].
Avesta Hojjati [2], head of R&D at DigiCert [2], cautioned that current quantum computing capabilities do not pose an immediate threat to existing encryption standards and emphasized the importance of discussing quantum readiness. The research underscores the need for organizations to invest in quantum-resistant technologies and update their security protocols to prepare for future threats [6]. It also highlights the importance of exploring diverse computing paradigms, such as D-Wave’s quantum annealing [6], to address cryptographic challenges while acknowledging the necessity for significant advancements before quantum computers can effectively break RSA-2048 encryption, which requires around 10,000 stable [6], error-corrected qubits [6].
Conclusion
The research conducted by Shanghai University highlights the potential of quantum computing to challenge existing cryptographic systems. While current encryption standards remain secure, the study emphasizes the importance of preparing for future quantum threats by investing in quantum-resistant technologies and updating security protocols. The exploration of diverse computing paradigms [6], such as quantum annealing [1] [4] [7], is crucial for addressing cryptographic challenges. However, significant advancements are necessary before quantum computers can effectively compromise modern encryption systems like RSA-2048.
References
[1] https://infosecu.technews.tw/2024/10/15/chinese-scientists-successfully-crack-spn-with-quantum-computer/
[2] https://www.techtarget.com/searchsecurity/news/366613737/Experts-slam-Chinese-research-on-quantum-encryption-attack
[3] https://www.benzinga.com/news/24/10/41325429/chinese-researchers-use-quantum-computers-to-reportedly-crack-rsa-encryption-raising-alarms-in-cyber
[4] https://www.devx.com/news/chinese-scientists-use-quantum-to-break-rsa/
[5] https://thenimblenerd.com/article/quantum-quake-how-chinas-research-shakes-up-future-encryption-fears/
[6] https://www.darkreading.com/application-security/chinese-researchers-unveil-quantum-technique-to-break-encryption
[7] https://thecyberexpress.com/quantum-computing-breaks-rsa-encryption/
