Information set decoding in the Lee metric with applications to cryptography
Type
journal article
Date Issued
2021
Author(s)
Abstract (De)
We convert Stern's information set decoding (ISD) algorithm to the ring ℤ/4ℤ 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 ℤ/psℤ.
Language
English
HSG Classification
contribution to scientific community
HSG Profile Area
None
Refereed
Yes
Publisher
AIMS
Publisher place
Advances in Mathematics of Communications
Volume
15
Number
4
Start page
677
End page
699
Subject(s)
Division(s)
Eprints ID
264209