HUBO and QUBO models for Prime factorization

Understand

The security of the RSA cryptosystem is based on the difficulty of factoring a large number N into prime numbers p and q satisfying N=p*q .

• This paper presents a prime factoriaation method using D-Wave quantum computer that can threaten the RSA cryptosystem.
• The starting point for this method is very simple, representing two prime numbers as qubits.
• Then, set the difference between the product of two prime numbers expressed in qubits and N as a cost function, and find the solution when the cost function becomes the minimum.