[Moodle] [CAS Campus]
Requirements
- Basic knowledge of cryptography and provable security (Cryptography course at HPI or equivalent)
- Interest in algebra/number theory
Description
Traditional cryptographic schemes based on RSA and discrete logarithms will become insecure when powerful quantum computers exist. To address this challenge, new quantum-safe alternatives have been developed and scrutinized through an open Post-Quantum Cryptography (PQC) competition. As a result, NIST standardized two lattice-based schemes: Kyber (ML-KEM) for encryption and Dilithium (ML-DSA) for signatures.
In this lecture, we will study these new lattice-based encryption and signatures schemes, and the mathematical foundations of lattice-based cryptography that are necessary to understand and reason about the security of these new schemes.
Lecture Content
The lecture will be based on the tutorial Basic Lattice Cryptography by Vadim Lyubashevsky (https://eprint.iacr.org/2024/1287.pdf).
We will cover topics such as: Lattices and their associated hard problems (LWE, SIS, SVP, CVP), polynomial rings, the FO-transform, LLL, the Fiat-Shamir transform, NTT, Kyber, Dilithium.