ConceptPhysics
Shor's algorithm
A quantum algorithm for integer factorization that can find the prime factors of a number exponentially faster than the best known classical algorithms.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
4Each in their own terms, from the easiest level.
Ryan O'Donnell
A polynomial-time quantum algorithm for integer factorization published by Peter Shor in 1994.Andrew Helwer
An algorithm that can efficiently factor large composite numbers to break RSA encryption.Michele Mosca
A quantum algorithm that breaks deployed public key cryptography methods.
Connections
8The lectures that define it or assume it, and the concepts next to it.