Key Reduction of McEliece's Cryptosystem Using List Decoding

Details Key Reduction of McEliece's Cryptosystem Using List Decoding Key Reduction of McEliece's Cryptosystem Using List Decoding

2011-02-13

arxiv.org/abs/1102.2566v2

International Symposium of Information Theory (ISIT) (2011) 2657-2661

Computer Science

Cryptography and Security

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Key Reduction of McEliece's Cryptosystem Using List Decoding does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Key Reduction of McEliece's Cryptosystem Using List Decoding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Key Reduction of McEliece's Cryptosystem Using List Decoding will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-186