Vidéos

5.7. The Fast Syndrome-Based (FSB) Hash Function
Vidéo pédagogique
00:08:21
5.7. The Fast Syndrome-Based (FSB) Hash Function
Marquez-Corbella
Irene
Sendrier
Nicolas
Finiasz
Matthieu

In the last session of this week, we will have a look at the FSB Hash Function which is built using the one-way function we saw in the previous session. What are the requirements for a

5.5. Stern’s Zero-Knowledge Identification Scheme
Vidéo pédagogique
00:07:11
5.5. Stern’s Zero-Knowledge Identification Scheme
Marquez-Corbella
Irene
Sendrier
Nicolas
Finiasz
Matthieu

In this session, we are going to have a look at Stern’s Zero-Knowledge Identification Scheme. So, what is a Zero-Knowledge Identification Scheme? An identification scheme allows a prover to prove

5.6. An Efficient Provably Secure One-Way Function
Vidéo pédagogique
00:05:20
5.6. An Efficient Provably Secure One-Way Function
Marquez-Corbella
Irene
Sendrier
Nicolas
Finiasz
Matthieu

In this session, we are going to see how to build an efficient provably secure one-way function from coding theory. As you know, a one-way function is a function which is simple to evaluate and

5.3. Attacks against the CFS Scheme
Vidéo pédagogique
00:04:51
5.3. Attacks against the CFS Scheme
Marquez-Corbella
Irene
Sendrier
Nicolas
Finiasz
Matthieu

In this session, we will have a look at the attacks against the CFS signature scheme. As for public-key encryption, there are two kinds of attacks against signature schemes. First kind of attack is

5.1. Code-Based Digital Signatures
Vidéo pédagogique
00:04:32
5.1. Code-Based Digital Signatures
Marquez-Corbella
Irene
Sendrier
Nicolas
Finiasz
Matthieu

Welcome to the last week of this MOOC on code-based cryptography. This week, we will be discussing other cryptographic constructions relying on coding theory. We have seen how to do public key

5.2. The Courtois-Finiasz-Sendrier (CFS) Construction
Vidéo pédagogique
00:04:21
5.2. The Courtois-Finiasz-Sendrier (CFS) Construction
Marquez-Corbella
Irene
Sendrier
Nicolas
Finiasz
Matthieu

In this session, I am going to present the Courtois-Finiasz-Sendrier Construction of a code-based digital signature. In the previous session, we have seen that it is impossible to hash a document

4.8. Attack against Algebraic Geometry codes
Vidéo pédagogique
00:06:45
4.8. Attack against Algebraic Geometry codes
Marquez-Corbella
Irene
Sendrier
Nicolas
Finiasz
Matthieu

In this session, we will present an attack against Algebraic Geometry codes (AG codes). Algebraic Geometry codes is determined by a triple. First of all, an algebraic curve of genus g, then a n

4.9. Goppa codes still resist
Vidéo pédagogique
00:04:03
4.9. Goppa codes still resist
Marquez-Corbella
Irene
Sendrier
Nicolas
Finiasz
Matthieu

All the results that we have seen this week doesn't mean that code based cryptography is broken. So in this session we will see that Goppa code still resists to all these attacks. So recall that

4.7. Attack against Reed-Muller codes
Vidéo pédagogique
00:05:47
4.7. Attack against Reed-Muller codes
Marquez-Corbella
Irene
Sendrier
Nicolas
Finiasz
Matthieu

In this session, we will introduce an attack against binary Reed-Muller codes. Reed-Muller codes were introduced by Muller in 1954 and, later, Reed provided the first efficient decoding algorithm

4.5. Error-Correcting Pairs
Vidéo pédagogique
00:05:31
4.5. Error-Correcting Pairs
Marquez-Corbella
Irene
Sendrier
Nicolas
Finiasz
Matthieu

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,

4.6. Attack against GRS codes
Vidéo pédagogique
00:05:27
4.6. Attack against GRS codes
Marquez-Corbella
Irene
Sendrier
Nicolas
Finiasz
Matthieu

In this session we will discuss the proposal of using generalized Reed-Solomon codes for the McEliece cryptosystem. As we have already said, generalized Reed-Solomon codes were proposed in 1986 by

Voir plus