## Attacking and defending the McEliece cryptosystem

Publication: Research - peer-review › Article in proceedings – Annual report year: 2008

Without internal affiliation

### Standard

**Attacking and defending the McEliece cryptosystem.** / Bernstein, Daniel J.; Lange, Tanja; Peters, Christiane.

Publication: Research - peer-review › Article in proceedings – Annual report year: 2008

### Harvard

*PROCEEDINGS OF POST-QUANTUM CRYPTOGRAPHY.*vol. Volume 5299, Springer Verlag, pp. 31-46. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. Volume 5299 LNCS, DOI: 10.1007/978-3-540-88403-3_3

### APA

*PROCEEDINGS OF POST-QUANTUM CRYPTOGRAPHY*(Vol. Volume 5299, pp. 31-46). Springer Verlag. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); No. Volume 5299 LNCS). DOI: 10.1007/978-3-540-88403-3_3

### CBE

### MLA

*PROCEEDINGS OF POST-QUANTUM CRYPTOGRAPHY.*Springer Verlag. 2008. 31-46. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Journal number Volume 5299 LNCS). Available: 10.1007/978-3-540-88403-3_3

### Vancouver

### Author

### Bibtex

}

### RIS

TY - GEN

T1 - Attacking and defending the McEliece cryptosystem

AU - Bernstein,Daniel J.

AU - Lange,Tanja

AU - Peters,Christiane

PY - 2008

Y1 - 2008

N2 - 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. © 2008 Springer Berlin Heidelberg. Keyword: list decoding binary Goppa code,Stern attack,minimal weight code word,MATHEMATICS,Quantum cryptography,Decoding,McEliece cryptosystem,security analysis,Codes (symbols),ALGORITHM,Cryptography,Technical presentations,COMPUTER,CODES

AB - 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. © 2008 Springer Berlin Heidelberg. Keyword: list decoding binary Goppa code,Stern attack,minimal weight code word,MATHEMATICS,Quantum cryptography,Decoding,McEliece cryptosystem,security analysis,Codes (symbols),ALGORITHM,Cryptography,Technical presentations,COMPUTER,CODES

U2 - 10.1007/978-3-540-88403-3_3

DO - 10.1007/978-3-540-88403-3_3

M3 - Article in proceedings

SN - 978-35-40-88402-6

VL - Volume 5299

SP - 31

EP - 46

BT - PROCEEDINGS OF POST-QUANTUM CRYPTOGRAPHY

PB - Springer Verlag

ER -