Information set decoding in the Lee metric with applications to cryptography

Abstract

<p style='text-indent:20px;'>We convert Stern's information set decoding (ISD) algorithm to the ring <inline-formula><tex-math id="M1">\begin{document}$ \mathbb{Z}/4 \mathbb{Z} $\end{document}</tex-math></inline-formula> equipped with the Lee metric. Moreover, we set up the general framework for a McEliece and a Niederreiter cryptosystem over this ring. The complexity of the ISD algorithm determines the minimum key size in these cryptosystems for a given security level. We show that using Lee metric codes can substantially decrease the key size, compared to Hamming metric codes. In the end we explain how our results can be generalized to other Galois rings <inline-formula><tex-math id="M2">\begin{document}$ \mathbb{Z}/p^s\mathbb{Z} $\end{document}</tex-math></inline-formula>.</p>