About

Log in?

DTU users get better search results including licensed content and discounts on order fees.

Anyone can log in and get personalized features such as favorites, tags and feeds.

Log in as DTU user Log in as non-DTU user No thanks

DTU Findit

Conference paper

Attacking and Defending the McEliece Cryptosystem

In Post-quantum Cryptography — 2008, pp. 31-46

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.

Language: English
Publisher: Springer Berlin Heidelberg
Year: 2008
Pages: 31-46
Proceedings: International Workshop on Post-Quantum Cryptography
ISBN: 3540884025 , 3540884033 , 9783540884026 and 9783540884033
Types: Conference paper
DOI: 10.1007/978-3-540-88403-3_3

DTU users get better search results including licensed content and discounts on order fees.

Log in as DTU user

Access

Analysis