Cryptanalysis of public-key cryptosystems that use subcodes of algebraic geometry codes - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

Cryptanalysis of public-key cryptosystems that use subcodes of algebraic geometry codes

Résumé

We give a polynomial time attack on the McEliece public key cryptosystem based on subcodes of algebraic geometry (AG) codes. The proposed attack reposes on the distinguishability of such codes from random codes using the Schur product. Wieschebrink treated the genus zero case a few years ago but his approach cannot be extent straightforwardly to other genera. We address this problem by introducing and using a new notion, which we call the t-closure of a code.
Fichier principal
Vignette du fichier
29-ICMCTA4-Final.pdf (106.14 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01069272 , version 1 (29-09-2014)

Identifiants

Citer

Alain Couvreur, Irene Márquez-Corbella, Ruud Pellikaan. Cryptanalysis of public-key cryptosystems that use subcodes of algebraic geometry codes. 4th ICMCTA - Fourth International Castle Meeting on Coding Theory and Applications, Sep 2014, Palmela, Portugal. ⟨hal-01069272⟩
369 Consultations
293 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More