Performance bounds for QC-MDPC codes decoders
From MaRDI portal
Publication:2163766
DOI10.1007/978-3-030-98365-9_6zbMath1495.94149OpenAlexW3217572366MaRDI QIDQ2163766
Franco Chiaraluce, Marco Baldi, Alessandro Barenghi, Gerardo Pelosi, Paolo Maria Santíni
Publication date: 11 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-98365-9_6
code-based cryptographypost-quantum cryptographymaximum likelihood decoderQC-MDPC codeserror floordecoding failure ratebit-flipping decoder
Uses Software
Cites Work
- Unnamed Item
- Squaring attacks on McEliece public-key cryptosystems using quasi-cyclic codes of even dimension
- Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes
- Decoding linear codes with high error rate and its impact for LPN security
- QC-MDPC: a timing attack and a CCA2 KEM
- A modular analysis of the Fujisaki-Okamoto transformation
- Encryption scheme based on expanded Reed-Solomon codes
- Fast polynomial inversion for post quantum QC-MDPC cryptography
- Cryptanalysis of LEDAcrypt
- On the decoding failure rate of QC-MDPC bit-flipping decoders
- Analysis of Information Set Decoding for a Sub-linear Error Weight
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- A Key Recovery Attack on MDPC with CCA Security Using Decoding Errors
- Decoding One Out of Many
- Algebraic Cryptanalysis of McEliece Variants with Compact Keys
- On the inherent intractability of certain coding problems (Corresp.)
- On the edge-independence number and edge-covering number for regular graphs
- Bounds on the decoding error probability of binary linear codes via their spectra
- The intractability of computing the minimum distance of a code
- About Low DFR for QC-MDPC Decoding
- QC-LDPC Code-Based Cryptography
- Analysis of reaction and timing attacks against cryptosystems based on sparse parity-check codes
