V2a: Kyber-PKE (simplified) (Kyber and Dilithium short course)

Explore the fundamentals of the Kyber Public-Key Encryption Scheme (PKE) in this video from Alfred Menezes's Kyber and Dilithium course on quantum-resistant cryptography. As part of the NIST standardization on August 13, 2024, Kyber represents a breakthrough in post-quantum cryptography, offering secure communication solutions designed to resist attacks from future quantum computers. This series of videos breaks down the core principles of Kyber-PKE and Kyber-KEM, from its lattice-based cryptographic foundation to its applications in modern cryptography. In this detailed introduction, you’ll learn how Kyber achieves secure public-key encryption through innovative lattice-based methods. We’ll examine why lattice-based cryptography provides robust protection against quantum threats, making it essential for today’s cybersecurity. Perfect for undergraduate and graduate students, applied cryptographers, security engineers, and cybersecurity professionals, this video provides a comprehensive look at Kyber-KEM and its role in building resilient, quantum-safe infrastructures. Stay ahead in the field of post-quantum cryptography with this video and the full Kyber and Dilithium course. Designed to empower you with the latest advancements in quantum-resistant security, this series is a valuable resource for securing tomorrow’s digital world. #KyberKEM #QuantumResistant #PostQuantumCryptography #LatticeCryptography #AppliedCryptography Lecture playlist: https://www.youtube.com/playlist?list=PLA1qgQLL41SSUOHlq8ADraKKzv47v2yrF Course web page: https://cryptography101.ca/kyber-dilithium The slides are available on the course web page. "Post-quantum cryptography" chapter from "Textbook of Applied Cryptography": https://drive.google.com/file/d/1D55HDa7imlBQXXW_CjbQftMuHZVoqNDa/view Other cryptography courses: https://cryptography101.ca Slides 00:00 Introduction 00:49 Chapter outline 01:20 Lecture outline 01:26 Slide 46: Notation 03:30 Slide 47: Rounding 05:08 Slide 48: Domain parameters and key generation 07:05 Slide 49: Encryption and decryption 08:54 Slide 50: Toy example: Kyber-PKE(s) (1) 10:03 Slide 51: Toy example: Kyber-PKE(s) (2) 11:06 Slide 52: Security 12:45 Slide 53: Decryption doesn't always work Corrections: 14:13 The bound on the error term e^T*r should be k*n*eta1*eta2 (instead of k*n*eta1^2).