CRITFeb 7, 2020

Protograph-Based Decoding of LDPC Codes with Hamming Weight Amplifiers

arXiv:2002.02696v1
AI Analysis

This work addresses decoding challenges in post-quantum cryptography, offering a more efficient solution for cryptographic systems, though it appears incremental as it builds on existing protograph and message-passing techniques.

The paper tackles the problem of decoding LDPC codes with Hamming weight amplifiers, used in post-quantum cryptography, by proposing a protograph-based framework that exchanges messages between decoders for the outer and inner codes. The result shows improved performance over basic methods and similar performance to MDPC decoding but with significantly lower computational complexity.

A new protograph-based framework for message passing (MP) decoding of low density parity-check (LDPC) codes with Hamming weight amplifiers (HWAs), which are used e.g. in the NIST post-quantum crypto candidate LEDAcrypt, is proposed. The scheme exploits the correlations in the error patterns introduced by the HWA using a turbo-like decoding approach where messages between the decoders for the outer code given by the HWA and the inner LDPC code are exchanged. Decoding thresholds for the proposed scheme are computed using density evolution (DE) analysis for belief propagation (BP) and ternary message passing (TMP) decoding and compared to existing decoding approaches. The proposed scheme improves upon the basic approach of decoding LDPC code from the amplified error and has a similar performance as decoding the corresponding moderate-density parity-check (MDPC) code but with a significantly lower computational complexity.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes