HUBO and QUBO models for prime factorization
Abstract
The 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.
Document Details
- Document Type
- Pub Defense Publication
- Publication Date
- Jun 21, 2023
- Source ID
- 10.1038/s41598-023-36813-x
Entities
People
- Hyunju Lee
- Kyungtaek Jun
Organizations
- Ministry of Science and ICT
- National Research Foundation of Korea