Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 118 of the 118 references it cites were found in a registry or an index.

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

Shor, Peter W. · 1999 · SIAM Review

Abstract

A digital computer is generally believed to be an efficient universal computing device; that is, it is believed to be able to simulate any physical computing device with an increase in computation time by at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration. This paper considers factoring integers and finding discrete logarithms, two problems that are generally thought to be hard on classical computers and that have been used as the basis of several proposed cryptosystems. 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, for example, the number of digits of the integer to be factored.

Overview

Integrity signals

Registry

Crossref · 10.1137/s0036144598347011

Cites

118 of 118 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

4 more claims about this paper

Create a free account to see every claim other papers make about this one.

See all claims — free account

Citations

Cites

Show all 115 references

Research works printed but not linked: 10

  1. Brassard G., 1993, SIGACT News, 24, 16
  2. R. Cleve (1994), A note on computing Fourier transforms by quantum programs , preprint.
  3. originally published in Optics News (February 1985), pp. 11–20.
  4. Karatsuba A., 1962, Dokl. Akad. Nauk SSSR, 145, 293
  5. 1963, Sov. Phys. Dokl., 7, 595
  6. R. Landauer (1997), Is quantum mechanically coherent computation useful? , in Proc. Drexel‐4 Symposium on Quantum Nonintegrability—Quantum Classical Correspondence, D. H. Feng and B‐L. Hu, eds., International Press, Cambridge, MA, to appear.
  7. Lecerf Y., 1963, C. R. Acad. Française Sci., 257, 2597
  8. N. Margolus (1990), Parallel quantum computation , in Complexity, Entropy and the Physics of Information, Santa Fe Institute Studies in the Sciences of Complexity, Vol. VIII, W. H. Zurek, ed., Addison‐Wesley, Reading, MA, pp. 273–287.
  9. P. W. Shor (1998) Quantum computing Documenta Mathematica, Extra Volume Proceedings ICM, Vol. I, pp. 305–324.
  10. 10.1112/plms/s2-43.6.544 · DOI · Paper page

Cited by

See all 3,904

Metadata

Authors
Shor, P. W.
Corresponding author
Shor, Peter W.
Venue
SIAM Review
Published
1999-01
Volume
41
Issue
2
Pages
303-332
ISSN
  • 0036-1445 (ISSN-L)
  • 1095-7200
OpenAlex
W2137147061
Cited by
3,904
References
115
Citations by year
2026: 326 · 2025: 550 · 2024: 481 · 2023: 463 · 2022: 405 · 2021: 355 · 2020: 271 · 2019: 195 · 2018: 151 · 2017: 124 · 2016: 70 · 2015: 47 · 2014: 40 · 2013: 56 · 2012: 44
FWCI
21.03
Type
journal article
Language
en
Open access
closed
Locations
  • SIAM Review (publishedVersion)
  • CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
  • Physical Sciences › Computer Science › Information Systems › Cryptography and Residue Arithmetic
Keywords
quantum computing, integer factorization, discrete logarithm problem, polynomial-time algorithms, randomized algorithms, ciphers, computational complexity, quantum algorithms

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer. https://app.cochat.ai/papers/10.1137/s0036144598347011
The paper
Shor, P. W. (1999). Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer. SIAM Review. https://doi.org/10.1137/s0036144598347011

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.