@article{wronski2021when,
  title = {When will Quantum Computing Break RSA-3072?},
  author = {Michal WRONSKI and Lukasz DZIERZKOWSKI},
  year = 2021,
  url = {https://ibimapublishing.com/p-articles/37AI/2021/37129121/},
  journal = {Communications of International Proceedings},
  volume = 2021 (8),
  abstract = {Since Peter W. Shor has developed a quantum algorithm for discrete logarithm and factorization, constructing a quantum computer, solving real-world cryptography problems began one of the essential things in modern cryptology. In this paper, we estimate when quantum computers will be able to factor 3072-bits RSA modulus. We focus on two different approaches: general-purpose quantum computing and quantum annealing.},
  keywords = {Cryptanalysis, factorization, RSA, quantum annealing, D-Wave},
  note = Article ID: 37129121
}