Completed
Enter Quantum Computing
Class Central Classrooms beta
YouTube playlists curated by Class Central.
Classroom Contents
Lattice Problems and Their Complexity - Crypto 2023 Session 2
Automatically move to the next video in the Classroom when playback concludes
- 1 Intro
- 2 Timed Cryptography
- 3 Hardness vs Fine-Grained Hardness
- 4 Landscape of Sequential Problems
- 5 Enter Quantum Computing
- 6 A New Sequential Function
- 7 The Sequentiality Assumption
- 8 Evidence of Sequentiality
- 9 Proofs of Sequential Work
- 10 Self-Symmetry
- 11 The Protocol (Step 2)
- 12 Soundness
- 13 Open Problems
- 14 Lattice Cryptanalysis
- 15 Hints [DDGR20]
- 16 Limitations [DDGR20]
- 17 Objectives
- 18 Basic Concepts
- 19 The DBDD Problem
- 20 Towards a New Approach
- 21 What do we Obtain?
- 22 Integrating Hints Geometrically
- 23 Perfect Hints
- 24 Ellipsoid Method a
- 25 Revisiting Decryption Failures
- 26 Full Sized Decryption Failures
- 27 Geometric Failure Boosting
- 28 Combined Hints
- 29 Discussion and Future Work
