About Low DFR for QC-MDPC Decoding - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2020

About Low DFR for QC-MDPC Decoding


McEliece-like code-based key exchange mechanisms using QC-MDPC codes can reach IND-CPA security under hardness assumptions from coding theory, namely quasi-cyclic syndrome decoding and quasi-cyclic codeword finding. To reach higher security requirements, like IND-CCA security, it is necessary in addition to prove that the decoding failure rate (DFR) is negligible, for some decoding algorithm and a proper choice of parameters. Getting a formal proof of a low DFR is a difficult task. Instead, we propose to ensure this low DFR under some additional security assumption on the decoder. This assumption relates to the asymptotic behavior of the decoder and is supported by several other works. We define a new decoder, Backflip, which features a low DFR. We evaluate the Backflip decoder by simulation and extrapolate its DFR under the decoder security assumption. We also measure the accuracy of our simulation data, in the form of confidence intervals, using standard techniques from communication systems.
Fichier principal
Vignette du fichier
2019-1434.pdf (362.35 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03139672 , version 1 (12-02-2021)



Nicolas Sendrier, Valentin Vasseur. About Low DFR for QC-MDPC Decoding. PQCrypto 2020 - Post-Quantum Cryptography 11th International Conference, Sep 2020, Paris / Virtual, France. pp.20--34, ⟨10.1007/978-3-030-44223-1_2⟩. ⟨hal-03139672⟩


67 View
285 Download



Gmail Facebook X LinkedIn More