AI Chat Paper
Discover the SciOpen Platform and Achieve Your Research Goals with Ease.
Search articles, authors, keywords, DOl and etc.
{{expandStatus?'Exit ':''}}Advanced Search
Integer factorization, the core of the Rivest−Shamir−Adleman (RSA) attack, is an exciting but formidable challenge. As of this year, a group of researchers’ latest quantum supremacy chip remains unavailable for cryptanalysis. Quantum annealing (QA) has a unique quantum tunneling advantage, which can escape local extremum in the exponential solution space, finding the global optimal solution with a higher probability. Consequently, we consider it an effective method for attacking cryptography. According to Origin Quantum Computing, QA computers are able to factor numbers several orders of magnitude larger than universal quantum computers. We try to transform the integer factorization problem in RSA attacks into a combinatorial optimization problem by using the QA algorithm of D-Wave quantum computer, and attack RSA-2048 which is composed of a class of special integers. The experiment factored this class of integers of size 22048, N=p×q. As an example, the article gives the results of 10 RSA-2048 attacks in the appendix. This marks the first successful factorization of RSA-2048 by D-Wave quantum computer, regardless of employing mathematical or quantum techniques, despite dealing with special integers, exceeding 21061−1 of California State University. This experiment verifies that the QA algorithm based on D-Wave is an effective method to attack RSA.
J. Cao, D. Wang, and W. Wang, The research on security of RSA Public-Key cipher, (in Chinese), Computer Technology and Develop. Ment., vol. 17, no. 1, p. 3, 2007.
B. Wang, F. Hu, H. Zhang, and C. Wang, From Evolutionary Cryptography to Quantum Artificial Intelligent Cryptography, (in Chinese), J. Comput. Res. Dev, vol. 56, no. 10, pp. 2112–2134, 2019.
C. Wang and H. Zhang, The impact of commercial quantum computer on cryptography, (in Chinese), Inf. Secur. Commun. Priv, vol. 2, pp. 31–32, 2012.
S. Morita and H. Nishimori, Convergence theorems for quantum annealing, J. Phys. A: Math. Gen, vol. 39, no. 45, p. 13903, 2006.
C. Wang, Y. Wang, and F. Hu, Shaping the future of commercial quantum computer and the challenge for information security, (in Chinese), J. Netw. Inf. Secur, vol. 2, no. 3, pp. 17–27, 2016.
S. Jiang, K. A. Britt, A. J. McCaskey, T. S. Humble, and S. Kais, Quantum annealing for prime factorization, Sci. Rep., vol. 8, no. 1, pp. 1–9, 2018.
W. Peng, B. Wang, F. Hu, Y. Wang, X. F, X. C, and C. Wang, Factoring larger integers with fewer qubits via quantum annealing with optimized parameters, Sci. China Phys. Mech. Astron., vol. 62, no. 06, pp. 1–8, 2019.
B. Wang, F. Hu, H. Yao, and C. Wang, Prime factorization algorithm based on parameter optimization of Ising model, Sci. Rep., vol. 10, no. 1, p. 7106, 2020.
C. Wang, Q. Hu, H. Yao, S. Wang, and Z. Pei, Deciphering a Million-Plus RSA Integer with Ultralow Local Field Coefficient h and Coupling Coefficient J of the Ising Model by D-Wave 2000Q, Tsinghua Science and Technology, vol. 29, no. 3, pp. 874–882, 2023.
F. X. Cui, B. Wang, Y. Liu, and Y. Li, Research status and prospect of quantum attack on public key cryptography, (in Chinese), Network Security and Data Governance, vol. 41, no. 3, pp. 3–12, 2022.
A. H. Karamlou, W. A. Simon, A. Katabarwa, T. L. Scholten, B. Peropadre, and Y. Cao, Analyzing the performance of variational quantum factoring on a superconducting quantum processor, npj Quantum Inf., vol. 7, no. 1, pp. 1–6, 2021.
The articles published in this open access journal are distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/).
京公网安备11010802044758号