Theoretical analysis of decoding failure rate of non-binary QC-MDPC codes
From MaRDI portal
Publication:6550574
Recommendations
- On the decoding failure rate of QC-MDPC bit-flipping decoders
- Performance bounds for QC-MDPC codes decoders
- About Low DFR for QC-MDPC Decoding
- Exploring decryption failures of BIKE: new class of weak keys and key recovery attacks
- Optimizing information set decoding algorithms to attack cyclosymmetric MDPC codes
Cites work
- scientific article; zbMATH DE number 3174791 (Why is no real title available?)
- scientific article; zbMATH DE number 3989251 (Why is no real title available?)
- scientific article; zbMATH DE number 177612 (Why is no real title available?)
- A Key Recovery Reaction Attack on QC-MDPC
- A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes
- A Polynomial-Time Attack on the BBCRS Scheme
- A public-key cryptosystem based on binary Reed-Muller codes
- A study of error floor behavior in QC-MDPC codes
- Algebraic cryptanalysis of McEliece variants with compact keys
- Cryptanalysis of Ivanov-Krouk-Zyablov cryptosystem
- Cryptanalysis of LEDAcrypt
- Cryptanalysis of McEliece Cryptosystem Based on Algebraic Geometry Codes and Their Subcodes
- Cryptanalysis of the BBCRS system on Reed-Muller binary code
- Cryptanalysis of the Niederreiter public key scheme based on GRS subcodes
- Cryptanalysis of the Sidelnikov Cryptosystem
- Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes
- Decoding one out of many
- Effective attack on the McEliece cryptosystem based on Reed-Muller codes
- Enhanced public key security for the McEliece cryptosystem
- Generalization of BJMM-ISD using May-Ozerov nearest neighbor algorithm over an arbitrary finite field \(\mathbb{F}_q\)
- Generalization of the ball-collision algorithm
- LEDAkem: a post-quantum key encapsulation mechanism based on QC-LDPC codes
- McEliece public key cryptosystems using algebraic-geometric codes
- On the decipherment of Sidel'nikov-type cryptosystems
- On the edge-independence number and edge-covering number for regular graphs
- On the inherent intractability of certain coding problems (Corresp.)
- Recovering short secret keys of RLCE in polynomial time
- Reducing Key Length of the McEliece Cryptosystem
- Soft-decision decoding of linear block codes based on ordered statistics
- Statistical Decoding Revisited
- Structural attacks for public key cryptosystems based on Gabidulin codes
Cited in
(2)
This page was built for publication: Theoretical analysis of decoding failure rate of non-binary QC-MDPC codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6550574)
