On the decoding failure rate of QC-MDPC bit-flipping decoders

DOI10.1007/978-3-030-25510-7_22OpenAlexW2958337549MaRDI QIDQ2302148FDOQ2302148

Authors: Nicolas Sendrier, Valentin Vasseur 

Publication date: 25 February 2020

Full work available at URL: https://hal.inria.fr/hal-03139797/file/2018-1207.pdf

Recommendations

• On constant-time QC-MDPC decoders with negligible failure rate
• QC-MDPC: a timing attack and a CCA2 KEM
• About Low DFR for QC-MDPC Decoding
• QC-MDPC decoders with several shades of gray
• Performance bounds for QC-MDPC codes decoders

Mathematics Subject Classification ID

Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94) Theory of error-correcting codes and error-detecting codes (94Bxx)

Cited In (16)

• QC-MDPC decoders with several shades of gray
• About Low DFR for QC-MDPC Decoding
• On constant-time QC-MDPC decoders with negligible failure rate
• Exploring decryption failures of BIKE: new class of weak keys and key recovery attacks
• Performance bounds for QC-MDPC codes decoders
• A closer look at the Guo-Johansson-Stankovski attack against QC-MDPC codes
• A key recovery attack on MDPC with CCA security using decoding errors
• QC-MDPC: a timing attack and a CCA2 KEM
• Preventing potential backdoors in BIKE algorithm
• Introducing arithmetic failures to accelerate QC-MDPC code-based cryptography
• LEDAcrypt: QC-LDPC code-based cryptosystems with bounded decryption failure rate
• CCA-secure (puncturable) KEMs from encryption with non-negligible decryption errors
• McEliece needs a break -- solving McEliece-1284 and quasi-cyclic-2918 with modern ISD
• Fast polynomial inversion for post quantum QC-MDPC cryptography
• A study of error floor behavior in QC-MDPC codes
• Theoretical analysis of decoding failure rate of non-binary QC-MDPC codes

This page was built for publication: On the decoding failure rate of QC-MDPC bit-flipping decoders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2302148)