loading
Papers Papers/2020

Research.Publish.Connect.

Paper

Authors: Marco Baldi 1 ; Alessandro Barenghi 2 ; Franco Chiaraluce 1 ; Gerardo Pelosi 2 and Paolo Santini 1

Affiliations: 1 DII, Università Politecnica delle Marche, Via Brecce Bianche 12, Ancona, Italy ; 2 DEIB, Politecnico di Milano, Piazza Leonardo da Vinci 32, Milano, Italy

ISBN: 978-989-758-446-6

ISSN: 2184-7711

Keyword(s): Bit-flipping Decoding, Code-based Cryptosystems, Decoding Failure Rate, LDPC Codes, MDPC Codes, Quasi-cyclic Codes, Post-quantum Cryptosystems.

Abstract: The design of quantum-resistant cryptographic primitives has gained attraction lately, especially thanks to the U.S.A. National Institute of Standards and Technology (NIST) initiative, which is selecting a portfolio of primitives for standardization. A prime position in the set of asymmetric encryption primitives is occupied by the ones relying on decoding random linear error correction codes as their trapdoor. Among these primitives, the LEDAcrypt and BIKE cryptosystems have been admitted to the second round of the standardization initiative. They are based on the adoption of iteratively decoded Low- and Moderate-Density Parity Check (LDPC/MDPC) codes. Characterizing the decoding failure rate of such codes under iterative decoding is paramount to the security of both the LEDAcrypt and BIKE second round candidates to achieve indistinguishability under adaptive chosen ciphertext attacks (IND-CCA2). For these codes, we propose a new iterative decoder, obtained through a simple modificat ion of the classic in-place bit-flipping decoder and, in this paper, we provide a statistical worst-case analysis of its performance. This result allows us to design parameters for LDPC/MDPC code-based cryptosystems with guaranteed extremely low failure rates (e.g., 2−128), fitting the hard requirement imposed by IND-CCA2 constructions. (More)

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.210.184.142

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Baldi, M.; Barenghi, A.; Chiaraluce, F.; Pelosi, G. and Santini, P. (2020). A Failure Rate Model of Bit-flipping Decoders for QC-LDPC and QC-MDPC Code-based Cryptosystems. In Proceedings of the 17th International Joint Conference on e-Business and Telecommunications - SECRYPT, ISBN 978-989-758-446-6 ISSN 2184-7711, pages 238-249. DOI: 10.5220/0009891702380249

@conference{secrypt20,
author={Marco Baldi. and Alessandro Barenghi. and Franco Chiaraluce. and Gerardo Pelosi. and Paolo Santini.},
title={A Failure Rate Model of Bit-flipping Decoders for QC-LDPC and QC-MDPC Code-based Cryptosystems},
booktitle={Proceedings of the 17th International Joint Conference on e-Business and Telecommunications - SECRYPT,},
year={2020},
pages={238-249},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0009891702380249},
isbn={978-989-758-446-6},
issn={2184-7711},
}

TY - CONF

JO - Proceedings of the 17th International Joint Conference on e-Business and Telecommunications - SECRYPT,
TI - A Failure Rate Model of Bit-flipping Decoders for QC-LDPC and QC-MDPC Code-based Cryptosystems
SN - 978-989-758-446-6
IS - 2184-7711
AU - Baldi, M.
AU - Barenghi, A.
AU - Chiaraluce, F.
AU - Pelosi, G.
AU - Santini, P.
PY - 2020
SP - 238
EP - 249
DO - 10.5220/0009891702380249

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.