Skip to Main content Skip to Navigation
Conference papers

Key Reduction of McEliece's Cryptosystem Using List Decoding

Morgan Barbier 1 Paulo S. L. M. Barreto 2 
1 TANC - Algorithmic number theory for cryptology
LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau], Inria Saclay - Ile de France
Abstract : 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.
Complete list of metadata

Cited literature [26 references]  Display  Hide  Download
Contributor : Morgan Barbier Connect in order to contact the contributor
Submitted on : Monday, November 14, 2011 - 3:27:56 PM
Last modification on : Friday, February 4, 2022 - 3:20:12 AM
Long-term archiving on: : Friday, November 16, 2012 - 10:51:53 AM


Publisher files allowed on an open archive


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



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⟩



Record views


Files downloads