On Decoding Schemes for the MDPC-McEliece Cryptosystem
On Decoding Schemes for the MDPC-McEliece Cryptosystem
复制标题
MDPC-McEliece密码系统的译码方案研究
DOI：
--
复制
发表时间：
2018
期刊：
影响因子：
--
通讯作者：
G. Liva
中科院分区：
文献类型：
--
作者：
H. Bartz;G. Liva
在本文中，考虑了现代密度奇偶校验检查（MDPC）代码的经典（迭代器）。在Guo，Johansson和Stankovski（GJS）的MDPC-Mceliece Cryptosystem上，提出并分析了拟议的解码算法与现有的硬式解码的实现了算法相比，提出了新的消息解码算法。可以降低基于GJS反应的攻击的有效性，以选择算法的参数。
In this paper, classical (iterative) decoding schemes for moderate-density parity-check (MDPC) codes are considered. The algorithms are analyzed with respect to their errorcorrection capability as well as their resilience against a recently proposed reaction-based key-recovery attack on a variant of the MDPC-McEliece cryptosystem by Guo, Johansson and Stankovski (GJS). New message-passing decoding algorithms are presented and analyzed. The proposed decoding algorithms have an improved error-correction performance compared to existing hard-decision decoding schemes and can reduce the effectiveness of the GJS reaction-based attack for an appropriate choice of the algorithm’s parameters.