Shor: quantum factoring and discrete logarithms

What changed

Gives polynomial-time algorithms for integer factorization and discrete logarithms in the quantum computation model.

Scientific scope

Gives polynomial-time algorithms for integer factorization and discrete logarithms in the quantum computation model. Scope limitation: The 1994 conference work is distinct from the linked 1995 preprint and later journal version. The complexity result assumes quantum computation; it does not establish that current devices can break practical cryptography.

Evidence

Assessment uses the catalogue-linked source evidence for the stated contribution. The 1994 conference work is distinct from the linked 1995 preprint and later journal version. The complexity result assumes quantum computation; it does not establish that current devices can break practical cryptography.

Contributors

• Peter Shor · SCIENCE: Named source contributor; exact labor shares are not measured.

• Shor, Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer (1995 preprint)

Provisional WRS assessment, edition 2026-10-16.1. Independent expert calibration is pending. This grade does not certify correctness or assign ownership.

Full scientific record · Browse contribution grades · Request a correction