Skip to Main content Skip to Navigation
New interface
Conference papers

Error-correcting pairs: a new approach to code-based cryptography

Abstract : McEliece proposed the first public-key cryptosystem based on linear error-correcting codes. A code with an efficient bounded distance decoding algorithm is chosen as secret key. It is assumed that the chosen code looks like a random code. The known efficient bounded distance decoding algorithms of the families of codes proposed for code-based cryptography, like Reed-Solomon codes, Goppa codes, alternant codes or algebraic geometry codes, can be described in terms of error-correcting pairs (ECP). That means that, the McEliece cryptosystem is not only based on the intractability of bounded distance decoding but also on the problem of retrieving an error-correcting pair from the public code. In this article we propose the class of codes with a t-ECP whose error-correcting pair that is not easily reconstructed from of a given generator matrix.
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download
Contributor : Irene Márquez Corbella Connect in order to contact the contributor
Submitted on : Friday, November 28, 2014 - 12:44:49 AM
Last modification on : Thursday, January 20, 2022 - 4:12:24 PM
Long-term archiving on: : Friday, April 14, 2017 - 10:46:09 PM


Files produced by the author(s)


  • HAL Id : hal-01088433, version 1



Irene Márquez-Corbella, Ruud Pellikaan. Error-correcting pairs: a new approach to code-based cryptography. 20th Conference on Applications of Computer Algebra (ACA 2014), Jul 2014, New York, United States. ⟨hal-01088433⟩



Record views


Files downloads