Enrollment is closed
  • End of Registration
  • Registration closed
  • Classes Start
  • may 25 2015
  • Classes End
  • jun 28 2015
  • Language
  • English

About This Course

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.

Targeted Audience

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.


Knowledge about linear algebra, finite field and complexity theory is required.

Course Syllabus

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

Course Teachers

Irene Marquez


Irene Márquez-Corbella is post-doctoral researcher of FSMP (Fondation Sciences Mathématiques de Paris) at Inria (France). Before she worked in the Inria Project-team GRACE (post-doctoral fellowship), the Coding and Cryptology group at the TUe and the UVa.
Research interests: Code-Based Cryptography, Coding Theory and Computer Algebra.

Nicolas Sendrier


Nicolas Sendrier obtained a Ph.D. (1991) and an "Habilitation à Diriger des Recherches" (2002) from University Paris 6. He has been a research scientist at Inria since 1992 and a senior research scientist since 2003.
Research interests: design and analysis of code-based cryptographic primitives.

Matthieu Finiasz

Matthieu FINIASZ

Matthieu Finiasz obtained his PhD from Inria in 2004. He then worked at EPFL before obtaining a research position at ENSTA-ParisTech. He is now a security expert at CryptoExperts (Paris).
Research interests: Code-Based Cryptography, and the various applications of Coding Theory to Cryptography (building blocks for symmetric cryptography, privacy protection...)

Organisation and Evaluation

Each week the teachers will propose video lectures and exercises.

At the end of the course a statement of completion will be provided for learners having obtained the required score to the exercises and the final evaluation.

Conditions of Use

The course material and the contents produced by users are provided under Creative Commons License BY-NC-ND: the name of the author should always be mentioned ; the user can exploit the work except in a commercial context and he cannot make changes to the original work.

This training course is produced by

logo inria recherche

Photo credits:
Video thumbnail: © Sergey Nivens - Fotolia.com
I. Marquez and N. Sendrier Pictures : © Inria - Guillaume Laidet
M. Finiasz Pictures: © M. Finiasz