Maximizing the practical achievability of quantum annealing attacks on factorization-based cryptography
<|reference_start|>Maximizing the practical achievability of quantum annealing attacks on factorization-based cryptography: This work focuses on quantum methods for cryptanalysis of schemes based on the integer factorization problem and the discrete logarithm problem. We demonstrate how to practically solve the largest instances of the factorization problem by improving an approach that combines quantum and classical computations, assuming the use of the best publicly available special-class quantum computer: the quantum annealer. We achieve new computational experiment results by solving the largest instance of the factorization problem ever announced as solved using quantum annealing, with a size of 29 bits. The core idea of the improved approach is to leverage known sub-exponential classical method to break the problem down into many smaller computations and perform the most critical ones on a quantum computer. This approach does not reduce the complexity class, but it assesses the pragmatic capabilities of an attacker. It also marks a step forward in the development of hybrid methods, which in practice may surpass classical methods in terms of efficiency sooner than purely quantum computations will.<|reference_end|>
@article{żołnierczyk2024maximizing,
    title={Maximizing the practical achievability of quantum annealing attacks on
  factorization-based cryptography},
    author={Olgierd .Zo{l}nierczyk},
    journal={arXiv preprint arXiv:2410.04956},
    year={2024},
    archivePrefix={arXiv},
    eprint={2410.04956},
    primaryClass={cs.CR}
}