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} }
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
Figures, Tables, and Topics from this paper
Figures and Tables
Paper Mentions
Blog Post
News Article
6,674 Citations
A Note on Shor's Quantum Algorithm for Prime Factorization
- Mathematics, Computer Science
- IACR Cryptol. ePrint Arch.
- 2005
- 1
- Highly Influenced
- PDF
Quantum algorithms for computing short discrete logarithms and factoring RSA integers
- Computer Science, Mathematics
- IACR Cryptol. ePrint Arch.
- 2017
- 12
Quantum algorithms for computing short discrete logarithms and factoring RSA integers
- Computer Science, Physics
- 2017
- 3
- PDF
A simplification of the Shor quantum factorization algorithm employing a quantum Hadamard transform
- Computer Science, Engineering
- Defense + Security
- 2018
- PDF
Shor’s factoring algorithm and modern cryptography. An illustration of the capabilities inherent in quantum computers
- Physics
- 2005
- 44
- PDF
Quantum Algorithm for Polynomial Root Finding Problem
- Mathematics
- 2014 Tenth International Conference on Computational Intelligence and Security
- 2014
References
SHOWING 1-10 OF 215 REFERENCES
Quantum Cryptanalysis of Hidden Linear Functions (Extended Abstract)
- Mathematics, Computer Science
- CRYPTO
- 1995
- 159
- PDF
Algorithms for quantum computation: discrete logarithms and factoring
- Mathematics, Computer Science
- Proceedings 35th Annual Symposium on Foundations of Computer Science
- 1994
- 4,853
- PDF
Good quantum error-correcting codes exist.
- Physics, Medicine
- Physical review. A, Atomic, molecular, and optical physics
- 1996
- 1,533
- PDF
Efficient networks for quantum factoring.
- Physics, Medicine
- Physical review. A, Atomic, molecular, and optical physics
- 1996
- 228
- PDF
The quantum challenge to structural complexity theory
- Computer Science
- [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference
- 1992
- 97
- PDF
On the power of quantum computation
- Mathematics, Computer Science
- Proceedings 35th Annual Symposium on Foundations of Computer Science
- 1994
- 982
- PDF
Two-bit gates are universal for quantum computation.
- Physics, Medicine
- Physical review. A, Atomic, molecular, and optical physics
- 1995
- 972
- PDF