Key Reduction of McEliece's Cryptosystem Using List Decoding - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Key Reduction of McEliece's Cryptosystem Using List Decoding

Résumé

Different variants of the code-based McEliece cryptosystem were pro- posed to reduce the size of the public key. All these variants use very structured codes, which open the door to new attacks exploiting the underlying structure. In this paper, we show that the dyadic variant can be designed to resist all known attacks. In light of a new study on list decoding algorithms for binary Goppa codes, we explain how to increase the security level for given public keysizes. Using the state-of-the-art list decoding algorithm instead of unique decoding, we exhibit a keysize gain of about 4% for the standard McEliece cryptosystem and up to 21% for the adjusted dyadic variant.
Fichier principal
Vignette du fichier
preprint.pdf (123.91 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

inria-00565343 , version 1 (11-02-2011)
inria-00565343 , version 2 (14-11-2011)

Identifiants

  • HAL Id : inria-00565343 , version 2
  • ARXIV : 1102.2566

Citer

Morgan Barbier, Paulo S. L. M. Barreto. Key Reduction of McEliece's Cryptosystem Using List Decoding. International Symposium of Information Theory (ISIT), Aug 2011, Saint-Peterburg, Russia. pp.2657-2661. ⟨inria-00565343v2⟩
136 Consultations
643 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More