Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

@article{Shor1999PolynomialTimeAF,
  title={Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer},
  author={P. Shor},
  journal={SIAM J. Comput.},
  year={1999},
  volume={26},
  pages={1484-1509}
}
  • P. Shor
  • Published 1999
  • Computer Science, Mathematics, Physics
  • SIAM J. Comput.
  • A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time by at most a polynomial factor. [...] Key Method Efficient randomized algorithms are given for these two problems on a hypothetical quantum computer. These algorithms take a number of steps polynomial in the input size, e.g., the number of digits of the integer to be factored.Expand Abstract
    6,674 Citations
    A Note on Shor's Quantum Algorithm for Prime Factorization
    • Zhengjun Cao
    • Mathematics, Computer Science
    • IACR Cryptol. ePrint Arch.
    • 2005
    • 1
    • Highly Influenced
    • PDF
    Quantum algorithms for computing short discrete logarithms and factoring RSA integers
    • 12
    Quantum algorithms for computing short discrete logarithms and factoring RSA integers
    • 3
    • PDF
    On computing ordN(2) and its application
    Discrete Logarithm (1994; Shor)
    • Highly Influenced
    • PDF
    On computing ord N ( 2 ) and its application
    • 1
    • PDF
    Quantum Cryptanalysis of Multivariate Permutation Problem
    • 1
    Quantum Algorithm for Polynomial Root Finding Problem

    References

    SHOWING 1-10 OF 215 REFERENCES
    Quantum Cryptanalysis of Hidden Linear Functions (Extended Abstract)
    • 159
    • PDF
    Algorithms for quantum computation: discrete logarithms and factoring
    • P. Shor
    • Mathematics, Computer Science
    • Proceedings 35th Annual Symposium on Foundations of Computer Science
    • 1994
    • 4,853
    • PDF
    Quantum Computers, Factoring, and Decoherence
    • 200
    • PDF
    Oracle Quantum Computing
    • 60
    • PDF
    Good quantum error-correcting codes exist.
    • Calderbank, Shor
    • Physics, Medicine
    • Physical review. A, Atomic, molecular, and optical physics
    • 1996
    • 1,533
    • PDF
    Efficient networks for quantum factoring.
    • 228
    • PDF
    The quantum challenge to structural complexity theory
    • A. Berthiaume, G. Brassard
    • Computer Science
    • [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference
    • 1992
    • 97
    • PDF
    Quantum Circuit Complexity
    • A. Yao
    • Mathematics, Computer Science
    • FOCS
    • 1993
    • 670
    • PDF
    On the power of quantum computation
    • D. Simon
    • Mathematics, Computer Science
    • Proceedings 35th Annual Symposium on Foundations of Computer Science
    • 1994
    • 982
    • PDF
    Two-bit gates are universal for quantum computation.
    • DiVincenzo
    • Physics, Medicine
    • Physical review. A, Atomic, molecular, and optical physics
    • 1995
    • 972
    • PDF