V0: Overview (Lattice Basis Reduction)

These lectures give a detailed explanation of the Lenstra-Lenstra-Lovasz (LLL) lattice-basis reduction algorithm, one of the most powerful and versatile tool in cryptanalysis. All the required mathematical background in linear algebra and lattices is provided. Topics covered: Post-quantum cryptography, the threat of quantum computers, Kyber, Dilithium, lattice basis reduction algorithm, LLL algorithm. Lecture playlist: https://www.youtube.com/playlist?list=PLA1qgQLL41SQ5oQDDH4V5ApkxnoKi_8jl Course web page: https://cryptography101.ca/lattice-basis-reduction/ The slides are available on the course web page. Lecture notes: "A gentle introduction to lattice-based cryptography" https://drive.google.com/file/d/1-G9qYuQhuHr0W4-YglVGub1PxdLyFHC6/view?usp=drive_link Other cryptography courses: https://cryptography101.ca Slides 00:00 Introduction 00:39 Slide 2: Public-key cryptographic schemes 01:56 Slide 3: Kyber and Dilithium 02:21 Slide 4: Security of Kyber and Dilithium 02:56 Slide 5: Lattice basis reduction 03:48 Slide 6: Course outline 04:52 Slide 7: Related courses on post-quantum cryptography