Code-Based Cryptography With Generalized Concatenated Codes for Restricted Error Values

Johann-Philipp Thiers

doi:10.1109/OJCOMS.2022.3206395

Code-Based Cryptography With Generalized Concatenated Codes for Restricted Error Values

2022-01-01

4

OA

AI

J

Johann-Philipp Thiers

J

Jürgen Freudenberger *

DOI：10.1109/OJCOMS.2022.3206395

Original

Original request for help

Save

Abstract

En 中文

Code-based cryptosystems are promising candidates for post-quantum cryptography. Recently, generalized concatenated codes over Gaussian and Eisenstein integers were proposed for those systems. For a channel model with errors of restricted weight, those q-ary codes lead to high error correction capabilities. Hence, these codes achieve high work factors for information set decoding attacks. In this work, we adapt this concept to codes for the weight-one error channel, i.e., a binary channel model where at most one bit-error occurs in each block of m bits. We also propose a low complexity decoding algorithm for the proposed codes. Compared to codes over Gaussian and Eisenstein integers, these codes achieve higher minimum Hamming distances for the dual codes of the inner component codes. This property increases the work factor for a structural attack on concatenated codes leading to higher overall security. For comparable security, the key size for the proposed code construction is significantly smaller than for the classic McEliece scheme based on Goppa codes.

Keywords:

Code-based cryptography

generalized concatenated codes

McEliece cryptosystem

public-key cryptography

restricted error values

Code-Based Cryptography With Generalized Concatenated Codes for Restricted Error Values

Abstract

Journal

Organization