On the decoding failure rate of QC-MDPC bit-flipping decoders
From MaRDI portal
Publication:2302148
Recommendations
Cited in
(16)- QC-MDPC decoders with several shades of gray
- On constant-time QC-MDPC decoders with negligible failure rate
- About Low DFR for QC-MDPC Decoding
- Exploring decryption failures of BIKE: new class of weak keys and key recovery attacks
- A closer look at the Guo-Johansson-Stankovski attack against QC-MDPC codes
- Performance bounds for QC-MDPC codes decoders
- 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
- CCA-secure (puncturable) KEMs from encryption with non-negligible decryption errors
- Introducing arithmetic failures to accelerate QC-MDPC code-based cryptography
- LEDAcrypt: QC-LDPC code-based cryptosystems with bounded decryption failure rate
- 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)