Upload_transparent

Attacking and defending the McEliece cryptosystem

 
 
 
 
 
macro

by macro

Value This
Doc
Scribd
Average
     
Pages: 16 43
Words: 7905 13640
Characters: 44580 81678
Lines: 257 623
     
     
Letters per word: 5.64 5.99
Words per line: 30.76 21.89
Words per page: 494.06 317.21

Add to your reading list

Flag_red Flag this document

Document Information

1,204 Reads | 0 Comments

Description

This paper presents several improvements to Stern's attack on the McEliece cryptosystem and achieves results considerably better than Canteaut et al. This paper shows that the system with the originally proposed parameters can be broken in just 1400 days by a single 2.4GHz Core 2 Quad CPU, or 7 days by a cluster of 200 CPUs. This attack has been implemented and is now in progress.

This paper proposes new parameters for the McEliece and Niederreiter cryptosystems achieving standard levels of security against all known attacks. The new parameters take account of the improved attack; the recent introduction of list decoding for binary Goppa codes; and the possibility of choosing code lengths that are not a power of 2. The resulting
public-key sizes are considerably smaller than previous parameter choices for the same level of security.

Pdf_16x16 16 Pages


Date Added

11/04/2008

Category
Tags
Groups
Copyright

Attribution Non-commercial

More info »