A study of error floor behavior in QC-MDPC codes
From MaRDI portal
Publication:6111579
DOI10.1007/978-3-031-17234-2_5zbMath1521.94123OpenAlexW4297042471MaRDI QIDQ6111579
Ray Perlner, Angela Robinson, Jun Bo Lau, Daniel Rayor Hast, Sarah Arpin, Tyler Raven Billingsley
Publication date: 7 July 2023
Published in: Post-Quantum Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-17234-2_5
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Fast polynomial inversion for post quantum QC-MDPC cryptography
- On constant-time QC-MDPC decoders with negligible failure rate
- 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 Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
- Finding All Small Error-Prone Substructures in LDPC Codes
- QC-LDPC Code-Based Cryptography