On the dimension and structure of the square of the dual of a Goppa code - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2022

On the dimension and structure of the square of the dual of a Goppa code

Résumé

The Goppa Code Distinguishing (GD) problem asks to distinguish efficiently a generator matrix of a Goppa code from a randomly drawn one. We revisit a distinguisher for alternant and Goppa codes through a new approach, namely by studying the dimension of square codes. We provide here a rigorous upper bound for the dimension of the square of the dual of an alternant or Goppa code, while the previous approach only provided algebraic explanations based on heuristics. Moreover, for Goppa codes, our proof extends to the non-binary case as well, thus providing an algebraic explanation for the distinguisher which was missing up to now. All the upper bounds are tight and match experimental evidence. Our work also introduces new algebraic results about products of trace codes in general and of dual of alternant and Goppa codes in particular, clarifying their square code structure. This might be of interest for cryptanalysis purposes.
Fichier principal
Vignette du fichier
arXiv.pdf (515.96 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03533235 , version 1 (18-01-2022)

Identifiants

  • HAL Id : hal-03533235 , version 1

Citer

Rocco Mora, Jean-Pierre Tillich. On the dimension and structure of the square of the dual of a Goppa code. 2022. ⟨hal-03533235⟩
51 Consultations
87 Téléchargements

Partager

Gmail Facebook X LinkedIn More