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/js97-8e44
Citer cette ressource :
Irene Marquez-Corbella, Nicolas Sendrier, Matthieu Finiasz. Inria. (2015, 5 mai). 3.3. Information Set Decoding: the Power of Linear Algebra , in 3: Message Attacks (ISD). [Vidéo]. Canal-U. https://doi.org/10.60527/js97-8e44. (Consultée le 19 juillet 2025)
RF-Inria-logo-RVB
Inria - Institut national de recherche en sciences et technologies du numérique
S'abonner
Contacter

3.3. Information Set Decoding: the Power of Linear Algebra

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

In this third session, wewill present the most important concept of the week:Information Set Decoding. The problem of decoding is notonly a combinatorial problem. Because we are dealing with linearcode, we may also use Linear Algebra. In particular, we are ableto transform the Computational Syndrome Decodingproblem by multiplying the matrix by apermutation P on the right and a nonsingular matrix U on the left. This will transform theproblem of syndrome decoding into an equivalent one. It is very easy to prove thatthe following equivalence holds. In fact, this implies thatthe two computational syndrome decoding that arepresented here are equivalent.
If I solve one ofthem, I solve the other. In particular, I canchoose H'in the following form which is calledsystematic form or standard form. If the first n-k columns of matrix H*P areindependent, then I am able to compute such a form. If thisis the case, the last k column of the matrixforms an information set. If I am lucky, thepermutation P will send the w error position inthe left part of the position. If this happens,then the modified syndrome s'will have a weight equalto the weight of the error. And I can check that very easily. I can transformthat into an algorithm. So, I want to solve thecomputational syndrome decoding presented here. I will repeatedly picka permutation P, compute the following systematicform using Gaussian elimination, and check whether thetransformed syndrome s*(U transpose) is a weight w. When this hapens, I canreturn the following vector which is validsolution to the original syndrome decoding problem. Here, each iteration of thisalgorithm will cost n*(n-k) column operations that is thecost of the Gaussian elimination. And I have to repeat thata certain number of times, until one of thesolutions to my problem has all its non-zero coordinates "all left". In the next session, I will present Complexity Analysis of thatalgorithm in particular as long as tools to make thecomplexity analysis of the variance of informationset decoding I will present throughout this course.

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