Maximizing the practical achievability of quantum annealing attacks on
factorization-based cryptography
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 …