History

Please fill in your query. A complete syntax description you will find on the General Help page.
Wild McEliece. (English)
Biryukov, Alex (ed.) et al., Selected areas in cryptography. 17th international workshop, SAC 2010, Waterloo, Ontario, Canada, August 12‒13, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-19573-0/pbk). Lecture Notes in Computer Science 6544, 143-158 (2011).
Summary: The original McEliece cryptosystem uses length-$n$ codes over {\bf 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 {\bf 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 {\bf 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.