Coding Techniques & Advanced Post-Quantum Cryptography
August 30 – September 3, 2021
Online
Free of charge
REGISTRATION
There are 2 options to participate.
- If you do not want a certificate of attendance, please register stating your name, affiliation, and e-mail address. Shortly before the event, we will send you the link to our Summer School.
- If you would like a certificate of attendance, please register stating some additional information and uploading your CV. At the end of our Summer School, you will take a short Quiz and we will issue a certificate for the event.
Questions? Contact our summer-school team at summer-school@cispa.de
©ERC
PROGRAM
Monday, August 30, 2021
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”
Tuesday, August 31, 2021
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”
Wednesday, September 1, 2021
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”
Thursday, September 2, 2021
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”
Friday, September 3, 2021
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”
