Corpus ID: 218502625

Breaking RSA Security With A Low Noise D-Wave 2000Q Quantum Annealer: Computational Times, Limitations And Prospects

@article{Mengoni2020BreakingRS,
  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},
  year={2020},
  volume={abs/2005.02268}
}
  • Riccardo Mengoni, Daniele Ottaviani, Paolino Iorio
  • Published 2020
  • Mathematics, Computer Science, Physics
  • ArXiv
  • 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… CONTINUE READING

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 23 REFERENCES

    Algorithms for quantum computation: discrete logarithms and factoring

    • Peter W. Shor
    • Computer Science, Mathematics
    • Proceedings 35th Annual Symposium on Foundations of Computer Science
    • 1994
    VIEW 3 EXCERPTS
    HIGHLY INFLUENTIAL

    Computational Complexity

    • Salil P. Vadhan
    • Computer Science
    • Encyclopedia of Cryptography and Security
    • 2011
    VIEW 2 EXCERPTS

    Adiabatic Quantum Computation and Quantum Annealing: Theory and Practice

    • Catherine C. McGeoch
    • Computer Science
    • Adiabatic Quantum Computation and Quantum Annealing: Theory and Practice
    • 2014
    VIEW 3 EXCERPTS
    HIGHLY INFLUENTIAL

    The role of symmetries in adiabatic quantum algorithms

    VIEW 1 EXCERPT