19 ressources en auto-formation : code correcteur

FILTRES

19 résultats
page 2 sur 2
Résultats de 11 à 19
Présentation de la ressource en auto-formation 4.3. Distinguisher for GRS codes cours / présentation
4.3. Distinguisher for GRS codes
Auteur(s) : MARQUEZ-CORBELLA Irene, SENDRIER Nicolas, FINIASZ Matthieu
Description : 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-Solomon codes. Let us recall the definition of Generalized Reed-Solomon codes. We will need an n-tuple ...
Présentation de la ressource en auto-formation 4.5. Error-Correcting Pairs cours / présentation
4.5. Error-Correcting Pairs
Auteur(s) : MARQUEZ-CORBELLA Irene, SENDRIER Nicolas, FINIASZ Matthieu
Description : 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, its dual is again a generalized Reed-Solomon code with the same locator and another column multiplier ...
Présentation de la ressource en auto-formation 4.9. Goppa codes still resist cours / présentation
4.9. Goppa codes still resist
Auteur(s) : MARQUEZ-CORBELLA Irene, SENDRIER Nicolas, FINIASZ Matthieu
Description : 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 it is assumed that Goppa codes are pseudorandom, that is there exist no efficient distinguisher for ...
Présentation de la ressource en auto-formation 4.1. Introduction cours / présentation
4.1. Introduction
Auteur(s) : MARQUEZ-CORBELLA Irene, SENDRIER Nicolas, FINIASZ Matthieu
Description : 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 of decoding a random linear code; these attacks has already been studied in the third week, by Nicolas ...
Présentation de la ressource en auto-formation 5.4. Parallel-CFS cours / présentation
5.4. Parallel-CFS
Auteur(s) : MARQUEZ-CORBELLA Irene, SENDRIER Nicolas, FINIASZ Matthieu
Description : 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 two different CFS signatures? For the signer, you simply take twice as much computation because you ...
Présentation de la ressource en auto-formation 5.5. Stern’s Zero-Knowledge Identification Scheme cours / présentation
5.5. Stern’s Zero-Knowledge Identification Scheme
Auteur(s) : MARQUEZ-CORBELLA Irene, SENDRIER Nicolas, FINIASZ Matthieu
Description : 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 his identity to a verifier. And the Zero-Knowledge Protocol is an interactive protocol where one pro ...
Présentation de la ressource en auto-formation 4.2. Support Splitting Algorithm cours / présentation
4.2. Support Splitting Algorithm
Auteur(s) : MARQUEZ-CORBELLA Irene, SENDRIER Nicolas, FINIASZ Matthieu
Description : 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 if they are equal up to a fixed linear map. Each linear map is the composition of a permutation, a scalar ...
Présentation de la ressource en auto-formation 5.2. The Courtois-Finiasz-Sendrier (CFS) Construction cours / présentation
5.2. The Courtois-Finiasz-Sendrier (CFS) Construction
Auteur(s) : MARQUEZ-CORBELLA Irene, SENDRIER Nicolas, FINIASZ Matthieu
Description : 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 into decodable syndromes. But it is possible to hash onto the space of all syndromes. The document is ...
Présentation de la ressource en auto-formation 5.7. The Fast Syndrome-Based (FSB) Hash Function cours / présentation
5.7. The Fast Syndrome-Based (FSB) Hash Function
Auteur(s) : MARQUEZ-CORBELLA Irene, SENDRIER Nicolas, FINIASZ Matthieu
Description : 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 cryptographic hash function? So, it is a function which takes an input of arbitrary size and outputs a fixed si ...