Is it hard to retrieve an error-correcting pair? - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

Is it hard to retrieve an error-correcting pair?

Abstract

Code-based cryptography is an interesting alternative to classic number-theory Public-Key Cryptosystems (PKC) since it is conjectured to be secure against quantum computer attacks. Many families of codes have been proposed for these cryp-tosystems. One of the main requirements is having high performance t-bounded decoding algorithms which is achieved in the case the code has a terror correcting pair (ECP). The class of codes with a t-ECP is proposed for the McEliece cryp-tosystem. The hardness of retrieving the t-ECP for a given code is considered. To this end we have to solve a large system of bilinear equations. Two possible induction procedures are considered, one for sub/super ECP's and one by punctur-ing/shortening. In both procedures in every step only a few bilinear equations need to be solved.
Fichier principal
Vignette du fichier
CACTC16-2.pdf (89.39 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-01409299 , version 1 (05-12-2016)

Identifiers

  • HAL Id : hal-01409299 , version 1

Cite

Irene Márquez-Corbella, Ruud Pellikaan. Is it hard to retrieve an error-correcting pair?. 22nd Conference on Applications of Computer Algebra (ACA 2016), Aug 2016, Kassel, Germany. ⟨hal-01409299⟩

Collections

INRIA INRIA2
87 View
68 Download

Share

Gmail Mastodon Facebook X LinkedIn More