TY  - CHAP
U1  - Konferenzveröffentlichung
A1  - Thiers, Johann-Philipp
A1  - Freudenberger, Jürgen
T1  - Codes over Eisenstein integers for the Niederreiter cryptosystem
T2  - 11th IEEE International Conference on Consumer Electronics (ICCE-Berlin 2021), 15 - 18 Nov. 2021, Berlin, virtual
N2  - Large-scale quantum computers threaten today's public-key cryptosystems. The  code-based  McEliece and Niederreiter cryptosystems are among the most promising candidates for post-quantum cryptography. Recently, a new class of q-ary product codes over Gaussian integers together with an efficient decoding algorithm were proposed for the McEliece cryptosystems. It was shown that these codes achieve a higher work factor for information-set decoding attacks than maximum  distance separable (MDS) codes with comparable length and dimension. In this work, we adapt this q-ary product code construction to codes over Eisenstein integers. We propose a new syndrome decoding method which is applicable for Niederreiter cryptosystems. The code parameters and work factors for information-set decoding are comparable to codes over Gaussian integers. Hence, the new construction is not favorable for the McEliece system. Nevertheless, it is beneficial for the Niederreiter system, where it achieves larger message lengths. While the Niederreiter and McEliece systems have the same level of security, the Niederreiter system can be advantageous for some applications, e.g., it enables digital signatures. The proposed coding scheme is interesting for lightweight Niederreiter cryptosystems and embedded security due to the short code lengths and low decoding complexity.
Y1  - 2022
SN  - 978-1-6654-2831-6
SB  - 978-1-6654-2831-6
SN  - 978-1-6654-2834-7
SB  - 978-1-6654-2834-7
U6  - https://doi.org/10.1109/ICCE-Berlin53567.2021.9720026
DO  - https://doi.org/10.1109/ICCE-Berlin53567.2021.9720026
N1  - Volltextzugriff für Angehörige der Hochschule Konstanz möglich
SP  - 6
S1  - 6
PB  - IEEE
ER  -