Skip to Main content Skip to Navigation
Conference papers

Reducing Key Length of the McEliece Cryptosystem

Thierry Pierre Berger 1 Pierre-Louis Cayrel 1 Philippe Gaborit 1 Ayoub Otmani 2
1 XLIM-DMI - DMI
XLIM - XLIM
2 Equipe AMACC - Laboratoire GREYC - UMR6072
GREYC - Groupe de Recherche en Informatique, Image, Automatique et Instrumentation de Caen
Abstract : The McEliece cryptosystem is one of the oldest public-key cryptosystem ever designated. It is also the first public-key cryptosystem based on linear error-correcting codes. The main advantage of the McEliece cryptosystem is to have a very fast encryption and decryption functions but suffers from a major drawback. It requires a very large public key which makes it very difficult to use in many practical situations. In this paper we propose a new general way to reduce the public key size through quasi-cyclic codes. Our construction introduces a new method of hiding the structure of the secret generator matrix by first choosing a subfield subcode of a quasi-cyclic code that is defined over a large alphabet and then by randomly shortening the chosen subcode. The security of our variant is related to the hardness of decoding a random quasi-cyclic code. We introduce a new decisional problem that is associated to the decoding of an arbitrary quasi-cyclic code. We prove that it is an NP-complete problem. Starting from subfield subcodes of quasi-cyclic generalized Reed-Solomon codes, we propose a system with several size of parameters from 6,000 to 11,000 bits with a security ranging from 2 80 to 2 107 . Implementations of our proposal show that we can encrypt at a speed of 120 Mbits/s (or one octet for 120 cycles). Hence our new proposal represents the most competitive public-key cryptosystem.
Complete list of metadatas

Cited literature [27 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01081727
Contributor : Greyc Référent <>
Submitted on : Monday, November 10, 2014 - 5:04:33 PM
Last modification on : Thursday, February 7, 2019 - 5:46:59 PM
Document(s) archivé(s) le : Wednesday, February 11, 2015 - 3:39:45 PM

File

ACTI-BERGER-2009-2.pdf
Files produced by the author(s)

Identifiers

Citation

Thierry Pierre Berger, Pierre-Louis Cayrel, Philippe Gaborit, Ayoub Otmani. Reducing Key Length of the McEliece Cryptosystem. Proceedings of Second International Conference on Cryptology - AFRICACRYPT 2009, Jun 2009, Gammarth, Tunisia. pp.77 - 97, ⟨10.1007/978-3-642-02384-2_6⟩. ⟨hal-01081727⟩

Share

Metrics

Record views

942

Files downloads

948