Speaker: Leon Manukyan
Dates: Monday through Thursday, July 28 - 31, 2025
Time: 6 PM
Venue: Museum Lecture Hall
Description:
The RSA lecture miniseries come in the wake of the recent presentation on quantum computers. One of the most prominent quantum algorithms will be presented to those interested. The goal is to deliver the material at a comfortable pace for audience able to grasp European math of the 18th century (that has made its way to our time). That is why the talk is spread over four sessions, each about an hour long.
Day 1. Monday, July 28. 6 PM. Overview of the RSA cryptosystem
Why is Shor's algorithm at all important? I will start by describing the RSA cryptosystem which is one of the oldest widely used systems for secure data transmission. This lecture covers the mathematical foundation underlying the RSA cryptosystem and establishes its connection with the integer factorization problem.
Day 2. Tuesday, July 29. 6 PM. Classical algorithms for integer factorization
One cannot fully appreciate Shor's quantum algorithm without having some background on the multitude of classical approaches that have been thrown at the integer factorization problem. A few of them will be presented on day 2.
Day 3. Wednesday, July 30. 6 PM. Introduction to quantum computation
This lecture will lay the necessary ground without which understanding of Shor's algorithm would remain far from adequate.
Day 4. Thursday, July 31. 6 PM. Shor’s algorithm for integer factorization
And finally we will dive into Shor's algorithm. On this day, you are encouraged to bring your quantum laptops with you in order to implement and run the algorithm fully on your own.
The RSA lecture miniseries come in the wake of the recent presentation on quantum computers. One of the most prominent quantum algorithms will be presented to those interested. The goal is to deliver the material at a comfortable pace for audience able to grasp European math of the 18th century (that has made its way to our time). That is why the talk is spread over four sessions, each about an hour long.
Day 1. Monday, July 28. 6 PM. Overview of the RSA cryptosystem
Why is Shor's algorithm at all important? I will start by describing the RSA cryptosystem which is one of the oldest widely used systems for secure data transmission. This lecture covers the mathematical foundation underlying the RSA cryptosystem and establishes its connection with the integer factorization problem.
Day 2. Tuesday, July 29. 6 PM. Classical algorithms for integer factorization
One cannot fully appreciate Shor's quantum algorithm without having some background on the multitude of classical approaches that have been thrown at the integer factorization problem. A few of them will be presented on day 2.
Day 3. Wednesday, July 30. 6 PM. Introduction to quantum computation
This lecture will lay the necessary ground without which understanding of Shor's algorithm would remain far from adequate.
Day 4. Thursday, July 31. 6 PM. Shor’s algorithm for integer factorization
And finally we will dive into Shor's algorithm. On this day, you are encouraged to bring your quantum laptops with you in order to implement and run the algorithm fully on your own.