The non-gap sequence of a subcode of a generalized Reed-Solomon code - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2011

The non-gap sequence of a subcode of a generalized Reed-Solomon code

Abstract

This paper addresses the question of how often the square code of an arbitrary l-dimensional subcode of the code GRSk(a; b) is exactly the code GRS2k-1(a; b * b). To answer this question we rst introduce the notion of gaps of a code which allows us to characterize such subcodes easily. This property was rst stated and used in [10] where Wieschebrink applied the Sidelnikov-Shestakov attack [8] to brake the Berger-Loidreau cryptostystem [1].
Fichier principal
Vignette du fichier
117.pdf (121.94 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00608102 , version 1 (12-07-2011)

Identifiers

  • HAL Id : inria-00608102 , version 1

Cite

Irene Marquez-Corbella, Edgar Martinez-Moro, Ruud Pellikaan. The non-gap sequence of a subcode of a generalized Reed-Solomon code. WCC 2011 - Workshop on coding and cryptography, Apr 2011, Paris, France. pp.183-192. ⟨inria-00608102⟩
300 View
181 Download

Share

Gmail Facebook Twitter LinkedIn More