Quantum Algorithms and Post-Quantum Cryptography
Offered By: Simons Institute via YouTube
Course Description
Overview
Syllabus
Intro
Exponential Speedups for Oracle Problems
NIST Post-Quantum Cryptography Standardization
Developing New Systems
Looking for Hard Problems for Crypto
Back to Lattices and Quantum Algorithms
What Makes Good Crypto?
Lattices, Cryptography, and Quantum Algorithms
Quantum Algorithm for the Unit Group
Special Cases of Lattices
The Unit Group and Finding Short Generators
Computing the Short Generator
Quantum Algorithm for Lattices?
What Else Can be used for Post-Quantum Crypto?
Crypto and Algorithms
Hard Isogeny Problem
The isogeny problem
The supersingular -isogeny graph
Two types of isogeny graphs
More Assumptions for Efficiency
How Secure is Isogeny-Based Crypto?
Computational Challenges
Three hardness assumptions
Finding Cycles in the Isogeny Graph using Structure
Summary
Taught by
Simons Institute
Related Courses
Isogeny-Based CryptographyTheIACR via YouTube Isogenies in Cryptography - Session 1
TheIACR via YouTube Isogenies in Cryptography - Session 2
TheIACR via YouTube Isogeny-Based Cryptography - Asiacrypt 2022 Session
TheIACR via YouTube Efficient Supersingularity Testing over F_p and CSIDH Key Validation - Part 1
TheIACR via YouTube