3: Message Attacks (ISD)

Mise en ligne : 05 mai 2015
  • niveau 1 niveau 2 niveau 3
  • audio 1 audio 2 audio 3
  • document 1 document 2 document 3
3.1. From Generic Decoding to Syndrome Decoding

Descriptif

Table of contents

3.1. From
Generic Decoding to Syndrome Decoding

3.2.
Combinatorial Solutions: Exhaustive Search and Birthday Decoding     

3.3.
Information Set Decoding: the Power of Linear Algebra   

3.4.
Complexity Analysis    

3.5. Lee
and Brickell Algorithm    

3.6.
Stern/Dumer Algorithm        

3.7. May,
Meurer, and Thomae Algorithm          

3.8.
Becker, Joux, May, and Meurer Algorithm   

3.9.
Generalized Birthday Algorithm for Decoding        

3.10.
Decoding One Out of Many

Vidéos

3.1. From Generic Decoding to Syndrome Decoding
Vidéo pédagogique
00:03:57
3.1. From Generic Decoding to Syndrome Decoding
Marquez-Corbella
Irene
Sendrier
Nicolas
Finiasz
Matthieu

Welcome to the third week of the MOOC on code-based cryptography. This week, we will learn about message attacks. Among the ten sessions of this week, the first six will present the most essential

3.2. Combinatorial Solutions: Exhaustive Search and Birthday Decoding
Vidéo pédagogique
00:05:16
3.2. Combinatorial Solutions: Exhaustive Search and Birthday Decoding
Marquez-Corbella
Irene
Sendrier
Nicolas
Finiasz
Matthieu

In this session, I will detail two combinatorial solutions to the decoding problem. The first one is the Exhaustive Search. To find our w columns, we will simply enumerate all the tuples j1 to jw

3.3. Information Set Decoding: the Power of Linear Algebra
Vidéo pédagogique
00:03:11
3.3. Information Set Decoding: the Power of Linear Algebra
Marquez-Corbella
Irene
Sendrier
Nicolas
Finiasz
Matthieu

In this third session, we will present the most important concept of the week: Information Set Decoding. The problem of decoding is not only a combinatorial problem. Because we are dealing with

3.5. Lee and Brickell Algorithm
Vidéo pédagogique
00:03:07
3.5. Lee and Brickell Algorithm
Marquez-Corbella
Irene
Sendrier
Nicolas
Finiasz
Matthieu

In this fifth session, we will study a variant of information set decoding proposed by Lee and Brickell. So, the main idea consists in relaxing the Prange algorithm to amortize the cost of the

3.6. Stern/Dumer Algorithm
Vidéo pédagogique
00:06:36
3.6. Stern/Dumer Algorithm
Marquez-Corbella
Irene
Sendrier
Nicolas
Finiasz
Matthieu

In this session, we will present the Stern algorithm for decoding. In fact, the idea is to combine two algorithms that we have seen before, the Lee and Brickell algorithm and the Birthday Decoding.

3.7. May, Meurer, and Thomae Algorithm
Vidéo pédagogique
00:07:27
3.7. May, Meurer, and Thomae Algorithm
Marquez-Corbella
Irene
Sendrier
Nicolas
Finiasz
Matthieu

So, with the session 7 we are entering the most advanced part of that course. The idea of what I called the  Improved Birthday Decoding is to use the so-called "representation technique" introduced

3.8. Becker, Joux, May, and Meurer Algorithm
Vidéo pédagogique
00:08:32
3.8. Becker, Joux, May, and Meurer Algorithm
Marquez-Corbella
Irene
Sendrier
Nicolas
Finiasz
Matthieu

Now in session 8, we will present yet another evolution of information set decoding. Before presenting this improvement, we will first improve the Birthday Decoding algorithm what I call a Further

3.9. Generalized Birthday Algorithm for Decoding
Vidéo pédagogique
00:08:26
3.9. Generalized Birthday Algorithm for Decoding
Marquez-Corbella
Irene
Sendrier
Nicolas
Finiasz
Matthieu

The session nine is devoted to the application of the Generalized Birthday Algorithm to decoding. The Generalized Birthday Algorithm was presented by David Wagner in 2002, in a more general

Intervenants