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/c7z0-r384
Citer cette ressource :
Irene Marquez-Corbella, Nicolas Sendrier, Matthieu Finiasz. Inria. (2015, 5 mai). 4.1. Introduction , in 4: Key Attacks. [Vidéo]. Canal-U. https://doi.org/10.60527/c7z0-r384. (Consultée le 15 juillet 2025)
logo Inria
Inria - Institut national de recherche en sciences et technologies du numérique
S'abonner
Contacter

4.1. Introduction

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

Welcome to the fourth week of the MOOC Code-based Cryptography. Recall that we have mainlytwo ways of cryptanalyzing in the McEliece cryptosystem.We have Message Attacks, which address the problem ofdecoding a random linear code; these attacks has alreadybeen studied in the third week, by Nicolas Sendrier. Notice that efficientgeneric attack just makes the use of larger code in theMcEliece scheme necessary. And we also have Key Attacks. These attacks try toretrieve the code structure, rather than attempting to use anspecific decoding algorithm. These attacks will bestudied during this week. First, let us give asmall introduction. The principle of theMcEliece cryptosystem is as follows: consider a large familyof codes, with an efficient decoding algorithm, whichis indistinguishable from a random family of linear codesof the same length and dimension. Then, the public key is agenerator matrix of a code of the chosen family and thenumber of errors that we can correct. And the secret key is anefficient decoding algorithm specific for such code. The encryption algorithm:we take a plaintext and the public key, and we generatean error-vector of weight at most t, which is theerror-correcting capacity. We encode the messageusing the public key, then, the ciphertext is just theresulting codeword, and the error. How to decrypt? We justapply the secret key that is an efficient decoding algorithm,to retrieve the original message. McEliece proposed to usebinary Goppa code, but the parameters that heproposed are not enough nowadays. But there exist other familiessuitable for the McEliece scheme? On the following slides, we give asummary of these different proposals.


Intervention
Thème
Disciplines :
Documentation
Support de présentation au format PDF

Dans la même collection

Voir tout

Avec les mêmes intervenants et intervenantes

Sur le même thème