Feb 13, 2011 � 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�...

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�...

Nov 14, 2011 � Abstract. Different variants of the code-based McEliece cryptosystem were pro- posed to reduce the size of the public key.

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�...

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�...

In this paper we describe a simple way to reduce significantly the key size in McEliece and related cryptosystems using a subclass of Goppa codes, while also�...

This paper shows that the quasi-dyadic variant of the code-based McEliece cryptosystem can be designed to resist all known attacks, and explains how to�...

Algorithm 1: Keys generation. Input: C is an [n,k]-code which is decodable up to t errors. Output: The public and secret keys (KP,KS ).

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�...

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�...