Breaking RSA Security With A Low Noise D-Wave 2000Q Quantum Annealer: Computational Times, Limitations And Prospects
Quantum Physics
2020-05-06 v1 Cryptography and Security
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.
Cite
@article{arxiv.2005.02268,
title = {Breaking RSA Security With A Low Noise D-Wave 2000Q Quantum Annealer: Computational Times, Limitations And Prospects},
author = {Riccardo Mengoni and Daniele Ottaviani and Paolino Iorio},
journal= {arXiv preprint arXiv:2005.02268},
year = {2020}
}