KnowraShor's algorithmLinked fromLinked fromThe 9 pages that link to Shor's algorithm, each with the reason it gives.All 9Broader topic 2Related 5Compared with 2Quantum computingBroader topic: It threatens widely used public-key cryptography if sufficiently large fault-tolerant computers exist.Integer factorizationRelated: It changes the expected difficulty of factoring if large fault-tolerant quantum computers become available.Public-key cryptographyRelated: It threatens the mathematical problems underlying RSA and common elliptic-curve systems.Elliptic-curve cryptographyRelated: It can solve the elliptic-curve discrete logarithm problem on a sufficiently powerful quantum computer.RSA cryptosystemRelated: It threatens RSA’s factoring-based security if large fault-tolerant quantum computers become practical.Post-quantum cryptographyRelated: It would break RSA and elliptic-curve cryptography on a sufficiently capable quantum computer.Discrete logarithmCompared with: It shows that sufficiently capable quantum computers would defeat the classical hardness assumption.Jacobi symbolCompared with: Unlike Jacobi-based classical tests, it attacks factorization through quantum period finding.BQPBroader topic: Its factoring procedure places integer factorization in BQP.