Vidéo pédagogique
Notice
Sous-titrage
Anglais
Langue :
Anglais
Crédits
Irene Marquez-Corbella (Intervention), Nicolas Sendrier (Intervention), Matthieu Finiasz (Intervention)
Conditions d'utilisation
Ces ressources de cours sont, sauf mention contraire, diffusées sous Licence Creative Commons. L’utilisateur doit mentionner le nom de l’auteur, il peut exploiter l’œuvre sauf dans un contexte commercial et il ne peut apporter de modifications à l’œuvre originale.
DOI : 10.60527/9esm-bw71
Citer cette ressource :
Irene Marquez-Corbella, Nicolas Sendrier, Matthieu Finiasz. Inria. (2015, 5 mai). 4.7. Attack against Reed-Muller codes , in 4: Key Attacks. [Vidéo]. Canal-U. https://doi.org/10.60527/9esm-bw71. (Consultée le 7 septembre 2024)

# 4.7. Attack against Reed-Muller codes

Réalisation : 5 mai 2015 - Mise en ligne : 21 février 2017
• document 1 document 2 document 3
• niveau 1 niveau 2 niveau 3
Descriptif

In this session, we willintroduce an attack against binary Reed-Muller codes. Reed-Muller codes wereintroduced by Muller in 1954 and, later, Reed provided thefirst efficient decoding algorithm for these codes. Reed-Muller are just ageneralization of generalized Reed-Solomon codes. Generalized Reed-Solomoncodes are evaluation of univariate polynomials,and Reed-Muller codes are evaluation ofmultivariate polynomials. We will study binary Reed-Muller codes. The binary Reed-Mullerconsists of the set of codewords obtained by evaluating all theBoolean functions of degree r with m variables. Thus, theblock length of this code is 2^m. The dimension is anumber of polynomials of degree r with binary coefficient, andthe minimum distance is 2^m - r. Let us study two examples. The first example is aReed-Muller associated to the evaluation of all monomialsof degree 1 in three variables. The vectors associatedto these monomials are the following ones, which gives agenerator matrix of the code. This code has parameters:length 8, dimension 4, and minimum distance 4, thatis, it detects two errors and correct just one error.Take notice that the matrix of a Reed-Muller code withdegree bound 1 has a particular form. If we remove the firstrow, then we have at  the i-th column just the number i-1read as a binary number. And this property willbe the key of the attack. Now, we have another example. We have the binaryReed-Muller code associated to the evaluation of monomialsof degree up to 2 in four variables. The vectorsassociated to this monomial are the following ones, which givea generator matrix of the code. This code has length 16,dimension 11, and minimum distance 4. Let us see someproperties of Reed-Muller code. First of all, we have thefollowing decreasing sequence. The code with the same degreebound as variables is the whole space. And moreover, the dual of aReed-Muller code is again a Reed-Muller code. And the proof is very easy.Just note that the dimension of the sum of these twocodes is 2^n, that is, the whole space. Moreover, the starproduct of these two codes is - this special code, which isthe code with all even weight vectors.

Intervention
Thème
Documentation

## Dans la même collection

• Vidéo pédagogique
00:03:56

### 4.4. Attack against subcodes of GRS codes

Marquez-Corbella
Irene
Sendrier
Nicolas
Finiasz
Matthieu

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

• 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

• 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,

• 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

• 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

• Vidéo pédagogique
00:04:46

### 4.1. Introduction

Marquez-Corbella
Irene
Sendrier
Nicolas
Finiasz
Matthieu

Welcome to the fourth week of the MOOC Code-based Cryptography. Recall that we have mainly two ways of cryptanalyzing in the McEliece cryptosystem. We have Message Attacks, which address the problem

• Vidéo pédagogique
00:06:20

### 4.2. Support Splitting Algorithm

Marquez-Corbella
Irene
Sendrier
Nicolas
Finiasz
Matthieu

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

• Vidéo pédagogique
00:05:18

### 4.3. Distinguisher for GRS codes

Marquez-Corbella
Irene
Sendrier
Nicolas
Finiasz
Matthieu

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

## Avec les mêmes intervenants et intervenantes

• 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,

• 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

• 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

• 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

• 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

• 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

• 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

• Vidéo pédagogique
00:03:56

### 4.4. Attack against subcodes of GRS codes

Marquez-Corbella
Irene
Sendrier
Nicolas
Finiasz
Matthieu

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

• Vidéo pédagogique
00:04:41

### 5.4. Parallel-CFS

Marquez-Corbella
Irene
Sendrier
Nicolas
Finiasz
Matthieu

In this session, I will present a variant of the CFS signature scheme called parallel-CFS. We start from a simple question: what happens if you try to use two different hash functions and compute

• 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

• 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

• 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

## Sur le même thème

• Conférence
01:00:50

### Des systèmes de numération pour le calcul modulaire

Bajard
Jean-Claude

Le calcul modulaire est utilisé dans de nombreuses applications des mathématiques, telles que la cryptographie. La réduction modulaire dans un contexte très général est coûteuse, car elle n

• Conférence
01:05:05

### Projection methods for community detection in complex networks

Litvak
Nelly

Community detection is one of most prominent tasks in the analysis of complex networks such as social networks, biological networks, and the world wide web. A community is loosely defined as a group

• Conférence
00:18:39

### Lara Croft. doing fieldwork under surveillance

Dall'Agnola
Jasmin

Lara Croft. Doing Fieldwork Under Surveillance Intervention de Jasmin Dall'Agnola (The George Washington University), dans le cadre du Colloque coorganisé par Anders Albrechtslund, professeur en

• Conférence
00:20:04

### Containing predictive tokens in the EU

Czarnocki
Jan

Containing Predictive Tokens in the EU – Mapping the Laws Against Digital Surveillance, intervention de Jan Czarnocki (KU Leuven), dans le cadre du Colloque coorganisé par Anders Albrechtslund,

• Conférence
00:22:25

### Inauguration de l'exposition - Vanessa Vitse : Nombres de Sophie Germain et codes secrets

Vitse
Vanessa

Exposé de Vanessa Vitse (Institut Fourier) : Nombres de Sophie Germain et codes secrets

• Conférence
01:06:10

### "Le mathématicien Petre (Pierre) Sergescu, historien des sciences, personnalité du XXe siècle"

Herléa
Alexandre

Alexandre HERLEA est membre de la section « Sciences, histoire des sciences et des techniques et archéologie industrielle » du CTHS. Professeur émérite des universités, membre effectif de l'Académie

• Conférence
00:40:11

### Ivan Murit - Processus de création d'images

Murit
Ivan

Je vais présenter une manière décalée d'aborder les outils d'impression. Pour cela nous ne partirons pas de l'envie d'imprimer une image préexistante, mais d'avant cela : comment se crée une forme

• Conférence
00:21:11

### Retour d'expérience sur l'utilisation croisée de plusieurs archives de fouilles

Tufféry
Christophe

Dans le cadre d'une thèse de doctorat engagée depuis 2019, une étude historiographique et épistémologique des effets des dispositifs numériques sur l'archéologie et sur les archéologues au cours des

• Conférence
01:19:36

### Information Structures for Privacy and Fairness

Palamidessi
Catuscia

Information Structures for Privacy and Fairness

• Documentaire
00:05:52

### Le Creativ’Lab, au cœur de la robotique et de l’intelligence artificielle (ASR N°18 - LORIA)

Hénaff
Patrick
Lefebvre
Sylvain

Le LORIA, laboratoire phare de la Grande Région dans le domaine de l’informatique, propose de rendre la recherche plus ouverte, plus collaborative, plus ambitieuse… en un mot, plus créative, à travers

• Conférence
01:01:22

### AI and Human Decision-Making: An Interdisciplinary Perspective

Castelluccia
Claude

This seminar will talk about some of the privacy risks of these systems and will describe some recent attacks. It will also discuss why they sometimes fail to deliver. Finally, we will also show that

• Cours/Séminaire
00:49:00

### Webinaire sur la rédaction des PGD

Louvet
Violaine

Rédaction des Plans de Gestion de Données (PGD) sous l’angle des besoins de la communauté mathématique.