YoVDO

How Quantum Computers Break Encryption - Shor's Algorithm Explained

Offered By: MinutePhysics via YouTube

Tags

Shor's Algorithm Courses Cryptography Courses Quantum Computing Courses Number Theory Courses Factorization Courses Modular Arithmetic Courses TLS Courses RSA Encryption Courses

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

Applied Cryptography
University of Virginia via Udacity Cryptography II
Stanford University via Coursera Coding the Matrix: Linear Algebra through Computer Science Applications
Brown University via Coursera Cryptography I
Stanford University via Coursera Unpredictable? Randomness, Chance and Free Will
National University of Singapore via Coursera