Converting of Simon Cipher Multivariate Polynomial Equations to Qubo Problem

Abstract The use of quantum annealing in the cryptanalysis of symmetric cryptography is a new idea based on the concept of algebraic attacks. This paper shows how to describe the Simon cipher as a system of multivariate polynomial equations so that the obtained optimization problem in the form of QUBO consistsof assmall number of binary variables aspossible. According to our calculations, the use of quantum annealing to an algebraic attack on the Simon128 / 128 cipher, since the QUBO problem consists of 27, 270 binary variables, is more effective than the same attack on the AES128 cipher, for which the QUBO problem includes 29, 770 binary variables.