Abstract
AbstractThe security of the RSA cryptosystem is based on the difficulty of factoring a large number N into prime numbers $$p$$
p
and $$q$$
q
satisfying $$N=p\times q$$
N
=
p
×
q
. This paper presents a prime factorization method using a D-Wave quantum computer that could threaten the RSA cryptosystem in the future. The starting point for this method is very simple, representing two prime numbers as qubits. Then, we set the difference between the product of the two prime numbers expressed in qubits and N as a cost function, and we find the solution when the cost function is minimized. D-Wave's quantum annealer can find the minimum value of any quadratic problem. However, the cost function must be a higher-order unconstrained optimization (HUBO) model because it contains second- or higher-order terms. We used a hybrid solver accessible via Leap, D-Wave’s real-time quantum cloud service, and the dimod package provided by the D-Wave Ocean software development kit (SDK) to solve the HUBO problem. We also successfully factorized 102,454,763 with 26 logical qubits. In addition, we factorized 1,000,070,001,221 using the range-dependent Hamiltonian algorithm.
Funder
Ministry of Science and ICT, South Korea
National Research Foundation of Korea
Publisher
Springer Science and Business Media LLC
Reference17 articles.
1. Rivest, R. L., Shamir, A. & Adleman, L. A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120–126 (1978).
2. Leander, G., & Rupp, A. On the equivalence of RSA and factoring regarding generic ring algorithms. In International Conference on the Theory and Application of Cryptology and Information Security. Springer, Berlin, Heidelberg, 2006.
3. Khatarkar, S. & Kamble, R. A survey and performance analysis of various RSA based encryption techniques. Int. J. Comput. Appl. 114, 7 (2015).
4. Shor, P.W. "Algorithms for quantum computation: discrete logarithms and factoring. In Proceedings 35th annual symposium on foundations of computer science. IEEE (1994).
5. Shor, P. W. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Rev. 41(2), 303–332 (1999).
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献