How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits

@article{Gidney2019HowTF,
  title={How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits},
  author={C. Gidney and Martin Ekeraa},
  journal={arXiv: Quantum Physics},
  year={2019}
}
We significantly reduce the cost of factoring integers and computing discrete logarithms in finite fields on a quantum computer by combining techniques from Shor 1994, Griffiths-Niu 1996, Zalka 2006, Fowler 2012, Eker{\aa}-H{\aa}stad 2017, Eker{\aa} 2017, Eker{\aa} 2018, Gidney-Fowler 2019, Gidney 2019. We estimate the approximate cost of our construction using plausible physical assumptions for large-scale superconducting qubit platforms: a planar grid of qubits with nearest-neighbor… Expand
105 Citations
Leveraging state sparsity for more efficient quantum simulations
Improved quantum circuits for elliptic curve discrete logarithms
Quantum Period Finding against Symmetric Primitives in Practice
Virtualized Logical Qubits: A 2.5D Architecture for Error-Corrected Quantum Computing
Concrete quantum cryptanalysis of binary elliptic curves
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 109 REFERENCES
Efficient networks for quantum factoring.
Quantum algorithms for computing short discrete logarithms and factoring RSA integers
Halving the cost of quantum addition
Improved reversible and quantum circuits for Karatsuba-based integer multiplication
Quantum computation with realistic magic-state factories
Quantum algorithms for computing general discrete logarithms and orders with tradeoffs
Factoring using $2n+2$ qubits with Toffoli based modular multiplication
Quantum Resource Estimates for Computing Elliptic Curve Discrete Logarithms
Modifying Shor's algorithm to compute short discrete logarithms
  • Martin Ekerå
  • Mathematics, Computer Science
  • IACR Cryptol. ePrint Arch.
  • 2016
Low overhead quantum computation using lattice surgery
...
1
2
3
4
5
...