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

https://hal.inria.fr/hal-01409299
Contributor : Irene Márquez Corbella <>
Submitted on : Monday, December 5, 2016 - 7:52:50 PM
Last modification on : Thursday, April 26, 2018 - 10:28:25 AM
Long-term archiving on: Tuesday, March 21, 2017 - 6:44:53 AM

File

CACTC16-2.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01409299, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

153

Files downloads

64