.png){kind=icon}
返回
Code-Based Cryptography With Generalized Concatenated Codes for Restricted Error Values
.png){kind=icon}
OA
AI
DOI：10.1109/OJCOMS.2022.3206395.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Code-based cryptography
generalized concatenated codes
McEliece cryptosystem
public-key cryptography
restricted error values
期刊
I
IF:
4.3
论文数:
1.7K
被引数:
991
机构
引用论文
GENETIC AND DEVELOPMENTAL ANALYSIS OF ABDOMINAL PIGMENTATION DIFFERENCES ACROSS SPECIES IN THE DROSOPHILA DUNNI SUBGROUP.png)
Evolution
EvolutionIF0
PREAI
分享收藏Determining the spectral responsivity from relative measurements by using multicolor light-emitting diodes as probing light sourcesOptik
OptikIF0
PREAI
分享收藏
查看更多内容