Quantum-Safe Cryptography (Sommersemester 2024)
Lecturer:
Dr. Gregor Seiler
(Cyber Security - Identity Management)
General Information
- Weekly Hours: 2
- Credits: 3
- Graded:
yes
- Enrolment Deadline: 01.04.2024 - 30.04.2024
- Examination time §9 (4) BAMA-O: 29.07.2024
- Teaching Form: Lecture
- Enrolment Type: Compulsory Elective Module
- Course Language: English
Programs, Module Groups & Modules
- CYAD: Cyber Attack and Defense
- HPI-CYAD-K Konzepte und Methoden
- CYAD: Cyber Attack and Defense
- HPI-CYAD-T Techniken und Werkzeuge
- CYAD: Cyber Attack and Defense
- HPI-CYAD-S Spezialisierung
- IDMG: Identity Management
- HPI-IDMG-K Konzepte und Methoden
- IDMG: Identity Management
- HDI-IDMG-T Techniken und Werkzeuge
- IDMG: Identity Management
- HPI-IDMG-S Spezialisierung
- ISAE: Internet, Security & Algorithm Engineering
- HPI-ISAE-T Techniken und Werkzeuge
- ISAE: Internet, Security & Algorithm Engineering
- HPI-ISAE-K Konzepte und Methoden
- ISAE: Internet, Security & Algorithm Engineering
- HPI-ISAE-S Spezialisierung
- DAPP: Data Applications
- HPI-DAPP-K Konzepte und Werkzeuge
- DAPP: Data Applications
- HPI-DAPP-T Techniken und Werkzeuge
- DAPP: Data Applications
- HPI-DAPP-S Spezialisierung
- HDAS: Health Data Security
- HPI-HDAS-C Concepts and Methods
- HDAS: Health Data Security
- HPI-HDAS-T Technologies and Methods
- HDAS: Health Data Security
- HPI-HDAS-S Specialization
- OISY: Online and Interactive Systems
- HPI-OISY-C Concepts and Methods
- OISY: Online and Interactive Systems
- HPI-OISY-T Technologies and Tools
- OISY: Online and Interactive Systems
- HPI-OISY-S Specialization
- MODA: Models and Algorithms
- HPI-MODA-C Concepts and Methods
- MODA: Models and Algorithms
- HPI-MODA-T Technologies and Tools
- MODA: Models and Algorithms
- HPI-MODA-S Specialization
Description
The lecture will serve as an introduction to contemporary applied lattice-based cryptography. We will study the mathematical foundations of integer lattices (definitions, examples, Minkowski theorems) and basis reduction (LLL), (cryptographic) lattice problems (SVP/CVP/SIS/LWE) and their security estimates with special attention on the structured polynomial variants, basic lattice crypto algorithms (hash functions, encryption schemes, signature schemes) and in particular the new NIST standards Kyber and Dilithium, and efficient software implementations (NTT-based polynomial arithmetic).
When time permits we will end the lecture with an outlook on more advanced constructions (trapdoor sampling, zero-knowledge proofs).
The grade for the course will be based on an oral exam after the end of the lecture (unless too may participants want to take the exam). There will be exercises.
Dates
The lecture and exercises are on Tuesday 11:00-12:30 and 13:30-15:00 in K-1.02, during the 1st halve of the semester (exact end date will be communicated at the beginning of the lecture).
Zurück
