On Decoding Schemes for the MDPC-McEliece Cryptosystem
Conference: SCC 2019 - 12th International ITG Conference on Systems, Communications and Coding
02/11/2019 - 02/14/2019 at Rostock, Germany
doi:10.30420/454862042
Proceedings: SCC 2019
Pages: 6Language: englishTyp: PDF
Personal VDE Members are entitled to a 10% discount on this title
Authors:
Bartz, Hannes; Liva, Gianluigi (Institute of Communication and Navigation, Deutsches Zentrum für Luft- und Raumfahrt (DLR), Wessling, Germany)
Abstract:
In this paper, classical (iterative) decoding schemes for moderate-density parity-check (MDPC) codes are considered. The algorithms are analyzed with respect to their error-correction 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.