Skip to Main content Skip to Navigation
Conference papers

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].
Complete list of metadata

Cited literature [10 references]  Display  Hide  Download

https://hal.inria.fr/inria-00608102
Contributor : Assia Saadi <>
Submitted on : Tuesday, July 12, 2011 - 11:08:05 AM
Last modification on : Wednesday, November 29, 2017 - 10:27:35 AM
Long-term archiving on: : Monday, November 12, 2012 - 10:50:53 AM

File

117.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00608102, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

476

Files downloads

329