Information, Théorie de l'

Pierre Mœglin Pierre Mœglin est à l’origine, en 1991, avec Élisabeth Fichez, du Sif, qu’il anime depuis cette date. Ses recherches portent en parallèle sur les industries éducatives et l

In this session, we will study critical attacks against the public-key cryptosystem. The partial knowledge on the plaintext reduces drastically the computational cost of the attack to the McEliece

This session will be about the support splitting algorithm. For the q-ary case, there are three different notions of equivalence. The general one: two codes of length n are semi-linear equivalent

Pierre Mœglin Pierre Mœglin est à l’origine, en 1991, avec Élisabeth Fichez, du Sif, qu’il anime depuis cette date. Ses recherches portent en parallèle sur les industries éducatives et l

In the next three sessions, I will explain how to reduce the key size of code-based cryptosystem. Circulant matrices are the central point in many attempts to reduce the key size of code-based

In this session we will see that generalized Reed-Solomon codes behave differently than random codes with respect to the star operation. Thus we can define a distinguisher for Generalized Reed

Pierre Mœglin Pierre Mœglin est à l’origine, en 1991, avec Élisabeth Fichez, du Sif, qu’il anime depuis cette date. Ses recherches portent en parallèle sur les industries éducatives et l

LDPC codes have an interesting feature: they are free of algebraic structure. We will study in detail this proposal for the McEliece cryptosystem in this session. LDPC codes were originally

In this session, we will talk about using subcodes of a Generalized Reed–Solomon code for the McEliece Cryptosystem. Recall that to avoid the attack of Sidelnikov and Shestakov, Berger and

Welcome to this MOOC which is entitled: code-based cryptography. This MOOC is divided in five weeks. The first week, we will talk about error-correcting codes and cryptography, this is an introduction

This is the last session where we will talk about reducing the key size. Here we will introduce the MDPC codes. In 2012, the MDPC codes were proposed for the McEliece schemes. An MDPC code is a

We present in this session a general decoding method for linear codes. And we will see it in an example. Let C be a generalized Reed-Solomon code of dimension k associated to the pair (c, d). Then,