Shor's algorithm is a quantum computer algorithm for finding the prime factors of an integer. It runs in polylogarithmic time, meaning it is significantly faster than the most efficient known classical factoring algorithm. In 2001, it was demonstrated by IBM using 7 qubits and has since been implemented with photonic and solid-state qubits.

Stanford University

Winter 2023

This course offers an introduction to cryptographic techniques used in computer security, covering encryption, message integrity, digital signatures, key management, and more. It is suitable for advanced undergraduates and masters students with some proof techniques and programming experience.

No concepts data

+ 55 more concepts