Degrees incorporating this pedagocial element :
Description
The aim of this course is to present some advanced topics in cryptography. The exact content may vary from one year to another; as an indication past topics have included:
- Linear secret sharing schemes (code-based schemes, access structures...)
- Provable constructions in symmetric cryptography (building block cipher from ideal permutations)
- Symmetric cryptanalysis (statistical and algebraic)
- Algorithms and constructions in code-based cryptography (information-set decoding, LPN)
- Zero-knowledge proofs
- Advanced signatures (group signatures...)
- Advanced constructions (oblivious transfer, group encryption...)
- Post-quantum cryptography
- Elliptic-curve and isogeny-based cryptography
Recommended prerequisite
A good knowledge of basic notions in cryptography (security definitions, classical constructions...) is expected. This should also be complemented by good skills in algorithmics and discrete mathematics (finite fields, linear algebra, statistics, elementary algebraic geometry...).
Courses offered by :
In brief
Period : Semester 9Credits : 6
Number of hours
- Practical work (TP) : 12h
- Lectures (CM) : 24h
- Tutorials (TD) : 12h
Hing methods : In person
Location(s) : Grenoble
Language(s) : English
Contact(s)
Pierre Karpman
Emmanuel PEYRE
