@inproceedings{0c074d045f054618bd5fb398641cef93,

title = "Wild McEliece",

abstract = "The original McEliece cryptosystem uses length-$n$ codes over $\rm{F}_2$ with dimension $\geq n-mt$ efficiently correcting t errors where $2^m \geq n$. This paper presents a generalized cryptosystem that uses length-$n$ codes over small finite fields $\rm{F}_q$ with dimension $\geq n-m(q-1)t$ efficiently correcting $\lfloor qt/2 \rfloor$ errors where $q^m \geq n$. Previously proposed cryptosystems with the same length and dimension corrected only $\lfloor (q-1)t/2 \rfloor$ errors for $q \geq 3$. This paper also presents list-decoding algorithms that efficiently correct even more errors for the same codes over $\rm{F}_q$. Finally, this paper shows that the increase from $\lfloor (q-1)t/2 \rfloor$ errors to more than $\lfloor qt/2 \rfloor$ errors allows considerably smaller keys to achieve the same security level against all known attacks.",

author = "D.J. Bernstein and T. Lange and C.P. Peters",

year = "2011",

doi = "10.1007/978-3-642-19574-7_10",

language = "English",

isbn = "978-3-642-19573-0",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "143--158",

editor = "A. Biryukov and G. Gong and D.R. Stinson",

booktitle = "Selected Areas in Cryptography (17th International Workshop, SAC 2010, Waterloo, Ontario, Canada, August 12-13, 2010, Revised Selected Papers)",

address = "Germany",

}