Corpus ID: 162183806

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={Craig Gidney and Martin Ekeraa},
  journal={arXiv: Quantum Physics},
  year={2019}
}
  • Craig Gidney, Martin Ekeraa
  • Published 2019
  • Mathematics, Physics
  • arXiv: Quantum Physics
  • 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, Ekera-Hastad 2017, Ekera 2017, Ekera 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 connectivity, a… CONTINUE READING

    Figures and Tables from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 28 CITATIONS

    Quantum estimation of classically intractable kernels for highly-entangled feature maps

    • Ziheng Cao caozh, Connie Hsueh chsueh, Irene Zhang ipzhang
    • 2019

    Improved quantum circuits for elliptic curve discrete logarithms

    VIEW 3 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    Quantum Algorithmic Techniques for Fault-Tolerant Quantum Computers

    VIEW 2 EXCERPTS
    CITES METHODS & BACKGROUND

    A Scalable Decoder Micro-architecture for Fault-Tolerant Quantum Computing

    VIEW 2 EXCERPTS
    CITES METHODS & BACKGROUND

    FILTER CITATIONS BY YEAR

    2017
    2020

    CITATION STATISTICS

    • 2 Highly Influenced Citations

    • Averaged 9 Citations per year from 2018 through 2020

    References

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

    Quantum algorithms for computing short discrete logarithms and factoring RSA integers

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Quantum algorithms for computing general discrete logarithms and orders with tradeoffs

    VIEW 5 EXCERPTS
    HIGHLY INFLUENTIAL

    Halving the cost of quantum addition

    VIEW 4 EXCERPTS

    Factoring using $2n+2$ qubits with Toffoli based modular multiplication

    VIEW 1 EXCERPT

    Modifying Shor's algorithm to compute short discrete logarithms

    • Martin Ekerå
    • Computer Science, Mathematics
    • IACR Cryptol. ePrint Arch.
    • 2016
    VIEW 2 EXCERPTS