Sciweavers

Share
CORR
2011
Springer

Key Reduction of McEliece's Cryptosystem Using List Decoding

11 years 15 days ago
Key Reduction of McEliece's Cryptosystem Using List Decoding
Different variants of the code-based McEliece cryptosystem were proposed 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 5% for the standard McEliece cryptosystem and up to 10% for the adjusted dyadic variant.
Morgan Barbier
Added 13 May 2011
Updated 13 May 2011
Type Journal
Year 2011
Where CORR
Authors Morgan Barbier
Comments (0)
books