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

Shor. (1997). Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer.

Type

Unclassified

Intellectual base

Unclassified

Year

1997

DOI

10.1137/s0097539795293172

Link

https://doi.org/10.1137/s0097539795293172

Cited by

1 citation across 1 artifact.

Domain-specific

• Public-Key Cryptography
  • This predicts that a capability inverting the specific trapdoor is an existential, not incremental, threat — which is precisely why quantum factoring reads as fatal to RSA while leaving lattice-based post-quantum schemes standing

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:6b58fba1e00e · see in the full table