We all use cryptography in our daily lives. The security of the most popular Public-Key Cryptosystems are based either on the hardness of factoring or the presumed intractability of the discrete logarithm problem. Advances on these problems or the construction of large quantum computers would dramatically change the landscape: Code-Based Cryptography is a powerful and promising alternative.
The objective of this course is to present the state of the art of these cryptosystems. This MOOC covers the essentials that you should know about this hot topic in Cryptography and Coding Theory: the security-reduction proofs, the possible attacks, several proposals to reduce the key-size, etc.
This course is intended for undergraduate and Master’s degree students in mathematics or computer science. Postgraduate students and researchers from the disciplines of computer algebra, coding theory and cryptography can also benefit from this course. More widely, mathematicians, physicists or engineers interested in information and communication technologies and every person who wants to know more about cryptography, coding theory or code-based cryptography can be interested in this course.
It is taught by Irène Marquez-Corbella, Nicolas Sendrier from SECRET team(Inria) and Matthieu Finiasz (CryptoExpert).
Programme :
Week 1 : Error-Correcting Codes and Cryptography
Week 2 : McEliece Cryptosystem
Week 3 : Message Attacks (ISD)
Week 4 : Key Attacks
Week 5 : Other cryptographic constructions relying on coding theory
Get the latest news about this course on Twitter: #CodeBasedCrypto
Track record and links:
Session 1 : May 25 to June 28, 2015
Session 2 : May 23 to July 26, 2016
- course presentation page on FUN
- The videos and the slides of the MOOC can be downloaded on Canal U
- Infographic of the 1st session
