A compact QUBO encoding of computational logic formulae demonstrated on cryptography constructions
<|reference_start|>A compact QUBO encoding of computational logic formulae demonstrated on cryptography constructions: We aim to advance the state-of-the-art in Quadratic Unconstrained Binary Optimization formulation with a focus on cryptography algorithms. As the minimal QUBO encoding of the linear constraints of optimization problems emerges as the solution of integer linear programming (ILP) problems, by solving special boolean logic formulas (like ANF and DNF) for their integer coefficients it is straightforward to handle any normal form, or any substitution for multi-input AND, OR or XOR operations in a QUBO form. To showcase the efficiency of the proposed approach we considered the most widespread cryptography algorithms including AES-128/192/256, MD5, SHA1 and SHA256. For each of these, we achieved QUBO instances reduced by thousands of logical variables compared to previously published results, while keeping the QUBO matrix sparse and the magnitude of the coefficients low. In the particular case of AES-256 cryptography function we obtained more than 8x reduction in variable count compared to previous results. The demonstrated reduction in QUBO sizes notably increases the vulnerability of cryptography algorithms against future quantum annealers, capable of embedding around $30$ thousands of logical variables.<|reference_end|>
@article{morse2024a,
    title={A compact QUBO encoding of computational logic formulae demonstrated on
  cryptography constructions},
    author={Gregory Morse, Tam'as Kozsik, Oskar Mencer, Peter Rakyta},
    journal={arXiv preprint arXiv:2409.07501},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.07501},
    primaryClass={cs.CR math-ph math.MP quant-ph}
}