About Low DFR for QC-MDPC Decoding
From MaRDI portal
Recommendations
- Performance bounds for QC-MDPC codes decoders
- On the decoding failure rate of QC-MDPC bit-flipping decoders
- On constant-time QC-MDPC decoders with negligible failure rate
- QC-MDPC decoders with several shades of gray
- A study of error floor behavior in QC-MDPC codes
- A Low Complexity-High Throughput QC-LDPC Encoder
- Efficient quantization algorithm for low-density parity-check code decoding
- scientific article; zbMATH DE number 6831541
- scientific article; zbMATH DE number 4216926
Cites work
- A key recovery attack on MDPC with CCA security using decoding errors
- An efficient pseudo-random generator provably as secure as syndrome decoding
- Analysis of information set decoding for a sub-linear error weight
- Decoding one out of many
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- scientific article; zbMATH DE number 3174791 (Why is no real title available?)
- On constant-time QC-MDPC decoders with negligible failure rate
- On the decoding failure rate of QC-MDPC bit-flipping decoders
- QC-MDPC: a timing attack and a CCA2 KEM
- Smaller keys for code-based cryptography: QC-MDPC McEliece implementations on embedded devices
- Weaknesses of Margulis and Ramanujan-Margulis low-density parity-check codes
Cited in
(9)- Ouroboros: a simple, secure and efficient key exchange protocol based on coding theory
- Performance bounds for QC-MDPC codes decoders
- On constant-time QC-MDPC decoders with negligible failure rate
- On the decoding failure rate of QC-MDPC bit-flipping decoders
- QC-MDPC decoders with several shades of gray
- A study of error floor behavior in QC-MDPC codes
- Exploring decryption failures of BIKE: new class of weak keys and key recovery attacks
- Theoretical analysis of decoding failure rate of non-binary QC-MDPC codes
- A combinatorial approach to avoiding weak keys in the BIKE cryptosystem
This page was built for publication: About Low DFR for QC-MDPC Decoding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5041211)