# Canal-U

Mon compte

## 4.8. Attack against Algebraic Geometry codes

Copier le code pour partager la vidéo :
<div style="position:relative;padding-bottom:56.25%;padding-top:10px;height:0;overflow:hidden;"><iframe src="https://www.canal-u.tv/video/inria/embed.1/4_8_attack_against_algebraic_geometry_codes.32953?width=100%&amp;height=100%" style="position:absolute;top:0;left:0;width:100%;height: 100%;" width="550" height="306" frameborder="0" allowfullscreen scrolling="no"></iframe></div> Si vous souhaitez partager une séquence, indiquez le début de celle-ci , et copiez le code : h m s
Contacter la chaine
J’aime
Imprimer
partager

### 4.8. Attack against Algebraic Geometry codes

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-tuple of rational points and then a divisor which has disjoint support from the n-tuple P. Then, the Algebraic Geometry code is obtained by evaluating at P all functions that belong to the vector space associated to the divisor E. Some properties of these codes are nearly optimal codes, that is, their designed minimum distance is nearly the optimal one. Moreover, the dual of an AG-code is again an AG-code. What about using Algebraic Geometry codes in code-based cryptography? Janwa and Moreno suggest to use Algebraic Geometry codes for the McEliece cryptosystem. This is a suitable proposal since these codes are nearly optimal and have efficient decoding algorithms. If we talk about codes over curves of genus zero then we are talking about generalized Reed-Solomon codes, as we will see in the next slides. So, for a curve of genus 0, this proposal is broken. If we talk about codes over curves of genus 1 and 2, then this proposal is broken by Faure and Minder. However, this attack has several drawbacks which makes it impossible to extend to a higher genera. But there is an attack for the general case. We will explain here this general attack. First over generalized Reed-Solomon codes and then we will give an idea on how it works for the general case. Recall that the generalized Reed-Solomon codes are Algebraic Geometry codes over curves of genus 0. Indeed, if we consider the projective line, this curve has genus 0 and its points are of the form (x:y) Now, we will consider P the n-tuple of points formed by these points and we take E to be K-1 times the point at the infinity. A basis of the vector space associated to this divisor is the following one. And if we evaluate this basis at the points P, we get a generator matrix of this AG code, which is also a generator matrix of a generalized Reed-Solomon code of dimension k associated to the pair (a,1), the all-ones vector.

•
Label UNT : UNIT
•
Date de réalisation : 5 Mai 2015
Durée du programme : 7 min
Classification Dewey : Analyse numérique, Théorie de l'information, données dans les systèmes informatiques, cryptographie, Mathématiques
•
Catégorie : Vidéocours
Niveau : niveau Master (LMD), niveau Doctorat (LMD), Recherche
Disciplines : Mathématiques, Informatique, Informatique, Mathématiques et informatique
Collections : 4: Key Attacks
ficheLom : Voir la fiche LOM
•
Auteur(s) : MARQUEZ-CORBELLA Irene, SENDRIER Nicolas, FINIASZ Matthieu
•
Langue : Anglais
Mots-clés : algèbre linéaire, chiffrement à clé publique, cryptage des données, cryptographie, code correcteur, algorithmes, GRS code
Conditions d’utilisation / Copyright : 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.

## commentaires

Ajouter un commentaire Lire les commentaires
*Les champs suivis d’un astérisque sont obligatoires.
Aucun commentaire sur cette vidéo pour le moment (les commentaires font l’objet d’une modération)