DeepAI AI Chat
Log In Sign Up

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

by   Rocco Mora, et al.

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.


page 1

page 2

page 3

page 4


New LMRD bounds for constant dimension codes and improved constructions

We generalize upper bounds for constant dimension codes containing a lif...

Equivalences among Z_p^s-linear Generalized Hadamard Codes

The _p^s-additive codes of length n are subgroups of _p^s^n, and can be ...

Distinguishing and Recovering Generalized Linearized Reed-Solomon Codes

We study the distinguishability of linearized Reed-Solomon (LRS) codes b...

On Some Ternary LCD Codes

The main aim of this paper is to study LCD codes. Linear code with compl...

The dual of an evaluation code

The aim of this work is to study the dual and the algebraic dual of an e...

Pursuit-evasion games on latin square graphs

We investigate various pursuit-evasion parameters on latin square graphs...

Polynomial time attack on high rate random alternant codes

A long standing open question is whether the distinguisher of high rate ...