Base of exponent representation matters -- more efficient reduction of discrete logarithm problem and elliptic curve discrete logarithm problem to the QUBO problem

This paper presents further improvements in the transformation of the Discrete Logarithm Problem (DLP) and Elliptic Curve Discrete Logarithm Problem (ECDLP) over prime fields to the Quadratic Unconstrained Binary Optimization (QUBO) problem. This is significant from a cryptanalysis standpoint, as QUBO problems may be solved using quantum annealers, and the fewer variables the resulting QUBO problem has, the less time is expected to obtain a solution. The main idea presented in the paper is allowing the representation of the exponent in different bases than the typically used base 2 (binary representation). It is shown that in such cases, the reduction of the discrete logarithm problem over the prime field \ (Fₚ\) to the QUBO problem may be obtained using approximately \ (1. 89n²\) logical variables for \ (n\) being the bitlength of prime \ (p\), instead of the \ (2n²\) which was previously the best-known reduction method. The paper provides a practical example using the given method to solve the discrete logarithm problem over the prime field \ (F₄₇\). Similarly, for the elliptic curve discrete logarithm problem over the prime field \ (Fₚ\), allowing the representation of the exponent in different bases than typically used base two results in a lower number of required logical variables for \ (n\) being the bitlength of prime \ (p\), from \ (3n³\) to \ (6n³₂ (3{4n) }\) logical variables, in the case of Edwards curves.