August 30 – September 3, 2021
Free of charge
Coding techniques and related assumptions are at the core of several exciting recent developments in cryptography. In particular, code-based assumptions have attracted attention as they offer conjectured post-quantum security and allow for very efficient and versatile implementations.
During this summer school, leaders of the field will present and discuss new developments concerning constructions of advanced cryptographic primitives based on code-based assumptions, as well as novel cryptanalytic methods to study these assumptions and understand the security they offer.
There are 2 options to participate.
2pm – 3pm Benny Applebaum (Tel-Aviv University) “On the Cryptographic Hardness of Random Linear Codes”
3pm – 4pm Zvika Brakerski (Weizmann Institute) ”Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing”
2pm – 3 pm Magali Bardet (Laboratoire LITIS, Université de Rouen) “Algebraic cryptanalysis of the Minrank, RSD and RSL problems and applications in Post-Quantum Cryptography”
3pm – 4pm Alexander May (Ruhr Universität Bochum) “Information Set Decoding - Algorithms and Practical Results”
10am 11am Yuval Ishai (Technion) “Low-Complexity Cryptography and Error-Correcting Codes”
2pm – 3pm Geoffroy Couteau (CNRS, IRIF, Université de Paris) “How to generate correlated pseudorandomness from (variants of) LPN - Part I”
3pm – 4pm Lisa Kohl (CWI Amsterdam) “How to generate correlated pseudorandomness from (variants of) LPN - Part II”
Afternoon Discussion and Q&A Session
7pm – 8pm Amit Sahai (University of California, Los Angeles) “Hardness of decoding random linear codes and advanced cryptographic feasibility”
9am – 10am Chaoping Xing (Shanghai Jiaotong University) “A brief survey on list decoding of classical block codes”
10am - 11am Leo Ducas (CWI Amsterdam) “An Algorithmic Reduction Theory for Binary Codes: LLL and more”
2pm – 3pm Alain Couvreur (LIX, Inria Saclay, École Polytechnique) “Cryptanalysis of algebraic codes endowed with the Hamming metric”