How Quantum Computers Break Encryption - Shor's Algorithm Explained
Offered By: MinutePhysics via YouTube
Course Description
Overview
Explore the groundbreaking Shor's Algorithm in this informative video, which delves into how quantum computers can efficiently factor large pseudoprime integers into their prime factors. Discover the number-theoretic analysis of the factoring problem using modular arithmetic and learn about finding the order or period of random coprime numbers. Understand the exponential speedup achieved through the quantum fast Fourier transform and its role in period-finding. Gain insights into RSA encryption, modulo multiplication group tables, difference of squares factorization, Euclid's Algorithm, and various factoring methods. Examine experimental implementations of Shor's Algorithm and its potential impact on current encryption methods like TLS and SSL.
Syllabus
How Quantum Computers Break Encryption | Shor's Algorithm Explained
Taught by
minutephysics
Related Courses
Understanding Quantum ComputersKeio University via FutureLearn Квантовые вычисления (Quantum computing)
Saint Petersburg State University via Coursera Quantum Information Science I, Part 2
Massachusetts Institute of Technology via edX The Introduction to Quantum Computing
Saint Petersburg State University via Coursera Quantum Computing
NPTEL via YouTube