Using Reed-Solomon codes in the (U | U + V ) construction and an application to cryptography - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

Using Reed-Solomon codes in the (U | U + V ) construction and an application to cryptography

Abstract

—In this paper we present a modification of Reed-Solomon codes that beats the Guruswami-Sudan 1 − √ R decoding radius of Reed-Solomon codes at low rates R. The idea is to choose Reed-Solomon codes U and V with appropriate rates in a (U | U + V) construction and to decode them with the Koetter-Vardy soft information decoder. We suggest to use a slightly more general version of these codes (but which has the same decoding performance as the (U | U + V)-construction) for being used in code-based cryptography , namely to build a McEliece scheme. The point is here that these codes not only perform nearly as well (or even better in the low rate regime) as Reed-Solomon codes, but also that their structure seems to avoid the Sidelnikov-Shestakov attack which broke a previous McEliece proposal based on generalized Reed-Solomon codes.
Fichier principal
Vignette du fichier
u+v-isit.pdf (571.21 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01410201 , version 1 (06-12-2016)

Identifiers

  • HAL Id : hal-01410201 , version 1

Cite

Irene Márquez-Corbella, Jean-Pierre Tillich. Using Reed-Solomon codes in the (U | U + V ) construction and an application to cryptography. International Symposium on Information Theory, Jul 2016, Barcelona, Spain. ⟨hal-01410201⟩

Collections

INRIA INRIA2
100 View
635 Download

Share

Gmail Mastodon Facebook X LinkedIn More