Breaking RSA Security With A Low Noise D-Wave 2000Q Quantum Annealer: Computational Times, Limitations And Prospects
This work addresses the challenge of implementing quantum attacks on cryptography for security researchers, but it is incremental as it builds on existing quantum annealing strategies without achieving a breakthrough.
The authors tackled the problem of breaking RSA encryption using quantum annealing instead of Shor's algorithm, finding that current hardware like the D-Wave 2000Q has computational times and limitations that hinder practical application, with no concrete performance numbers provided in the abstract.
The RSA cryptosystem could be easily broken with large scale general purpose quantum computers running Shor's factorization algorithm. Being such devices still in their infancy, a quantum annealing approach to integer factorization has recently gained attention. In this work, we analyzed the most promising strategies for RSA hacking via quantum annealing with an extensive study of the low noise D-Wave 2000Q computational times, current hardware limitations and challenges for future developments.