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

I. Márquez-Corbella; E. Martínez-Moro; G.R. Pellikaan

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

I. Márquez-Corbella, E. Martínez-Moro, G.R. Pellikaan

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/Congresprocedure › Conferentiebijdrage › Academic › peer review

126 Downloads (Pure)

Samenvatting

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 first introduce the notion of gaps of a code which allows us to characterize such subcodes easily. This property was first stated and used in [10] where Wieschebrink applied the Sidelnikov-Shestakov attack [8] to brake the Berger-Loidreau cryptostystem [1].

Originele taal-2	Engels
Titel	Seventh International Workshop on Coding and Cryptography 2011 (WCC 2011, Paris, France, April 11-15, 2011)
Pagina's	1-10
Status	Gepubliceerd - 2011

Toegang tot document

448885357154615Definitieve gepubliceerde versie, 295 KB

Citeer dit

@inproceedings{7e3d39bd36bf4b08a0f3050d51450771,

title = "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 first introduce the notion of gaps of a code which allows us to characterize such subcodes easily. This property was first stated and used in [10] where Wieschebrink applied the Sidelnikov-Shestakov attack [8] to brake the Berger-Loidreau cryptostystem [1].",

author = "I. M{\'a}rquez-Corbella and E. Mart{\'i}nez-Moro and G.R. Pellikaan",

year = "2011",

language = "English",

pages = "1--10",

booktitle = "Seventh International Workshop on Coding and Cryptography 2011 (WCC 2011, Paris, France, April 11-15, 2011)",

}

TY - GEN

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

AU - Márquez-Corbella, I.

AU - Martínez-Moro, E.

AU - Pellikaan, G.R.

PY - 2011

Y1 - 2011

N2 - 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 first introduce the notion of gaps of a code which allows us to characterize such subcodes easily. This property was first stated and used in [10] where Wieschebrink applied the Sidelnikov-Shestakov attack [8] to brake the Berger-Loidreau cryptostystem [1].

AB - 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 first introduce the notion of gaps of a code which allows us to characterize such subcodes easily. This property was first stated and used in [10] where Wieschebrink applied the Sidelnikov-Shestakov attack [8] to brake the Berger-Loidreau cryptostystem [1].

M3 - Conference contribution

SP - 1

EP - 10

BT - Seventh International Workshop on Coding and Cryptography 2011 (WCC 2011, Paris, France, April 11-15, 2011)

ER -

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

Samenvatting

Toegang tot document

Vingerafdruk

Citeer dit