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/r1mp-sg45
Citer cette ressource :
Irene Marquez-Corbella, Nicolas Sendrier, Matthieu Finiasz. Inria. (2015, 5 mai). 5.7. The Fast Syndrome-Based (FSB) Hash Function , in 5: Other cryptographic constructions relying on coding theory. [Vidéo]. Canal-U. https://doi.org/10.60527/r1mp-sg45. (Consultée le 18 juin 2024)

# 5.7. The Fast Syndrome-Based (FSB) Hash Function

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 the last session of thisweek, we will have a look at the FSB Hash Function whichis built using the one-way function we saw inthe previous session. What are the requirements fora cryptographic hash function? So, it is a function whichtakes an input of arbitrary size and outputs a fixed size. From a security point ofview, it should be hard to solve any of the three followingproblems: first, find an input with a given hash which iswhat we call preimage attacks; find an input with the samehash as a given input which is what we call secondpreimage attack; or find two inputs with the same hash whichis what we call collision attack. In addition, hash function havesome implementation constraints. It should be fast inboth software and hardware implementations, it shouldbe fast for both small inputs and large inputs and itshould have a compact description. Building a function ofarbitrary length is something which is not that obvious.Usually, you simply iterate a function with a fixed inputsize on blocks of the input. There are severalconstructions to achieve this, the oldest one is theMerkle-Damgård Construction. This function iterates acompression function f which takes at each round apart of the message m0, m1 or something like this andstarts with an IV or the chaining value which is the output ofthe previous compression function. It is easy to understand andit has a simple security proof. So, it is something that is usedpretty commonly in cryptography. Another constructionwhich is commonly used in cryptography is theDavies-Meyer Construction. For the compression function, thisconstruction uses a block cipher E. The message is used as thekey of the block cipher and the input is the chaining value. An interesting element ofthis construction is that it reuses the samehardware as the block cipher. So, if you have animplementation which already includes a block cipher, you don'tneed any more implementations. A much more recentconstruction is the Sponge construction. This construction uses a functionwith the same input and output size. The message is XORed to a partof an internal state fed to the function which issome kind of permutation, then, another part of themessage is exhorted and so on. This is the absorb phase. Once you have finishedabsorbing all the message in the padding, you have a squeezeout phase where you take out - bits of the message from the internalstate, iterating the function f again. The interesting aspect of thisconstruction is its versatility. It can be used as both thehash function where the input is larger than the outputor a pseudo-random generator where the input is smalland the output is large.

Intervention
Thème
Documentation

## Dans la même collection

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

• 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

## Avec les mêmes intervenants et intervenantes

• 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

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

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

## 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.