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.
Type de document :
Communication dans un congrès
International Symposium on Information Theory, Jul 2016, Barcelona, Spain. 2016, 〈http://www.isit2016.org/〉
Liste complète des métadonnées

Littérature citée [19 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01410201
Contributeur : Jean-Pierre Tillich <>
Soumis le : mardi 6 décembre 2016 - 15:08:31
Dernière modification le : jeudi 26 avril 2018 - 10:28:23
Document(s) archivé(s) le : mardi 21 mars 2017 - 00:54:58

Fichier

u+v-isit.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01410201, version 1

Collections

Citation

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. 2016, 〈http://www.isit2016.org/〉. 〈hal-01410201〉

Partager

Métriques

Consultations de la notice

152

Téléchargements de fichiers

129