Theoretical analysis of decoding failure rate of non-binary QC-MDPC codes

DOI10.1007/978-3-031-46495-9_3MaRDI QIDQ6550574FDOQ6550574

Authors: K. V. Vedenev, Yury V. Kosolapov 

Publication date: 5 June 2024

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

zbMATH Keywords

code-based cryptographydecoding failure ratenon-binary MDPC codessymbol flipping

Mathematics Subject Classification ID

Cryptography (94A60) Theory of error-correcting codes and error-detecting codes (94Bxx)

Cites Work

• A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes
• LEDAkem: a post-quantum key encapsulation mechanism based on QC-LDPC codes
• Title not available (Why is that?)
• Algebraic cryptanalysis of McEliece variants with compact keys
• Reducing Key Length of the McEliece Cryptosystem
• Structural attacks for public key cryptosystems based on Gabidulin codes
• Enhanced public key security for the McEliece cryptosystem
• Cryptanalysis of the Niederreiter public key scheme based on GRS subcodes
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the inherent intractability of certain coding problems (Corresp.)
• On the edge-independence number and edge-covering number for regular graphs
• Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes
• Decoding one out of many
• A public-key cryptosystem based on binary Reed-Muller codes
• Cryptanalysis of the Sidelnikov Cryptosystem
• Cryptanalysis of McEliece Cryptosystem Based on Algebraic Geometry Codes and Their Subcodes
• Soft-decision decoding of linear block codes based on ordered statistics
• McEliece public key cryptosystems using algebraic-geometric codes
• Recovering short secret keys of RLCE in polynomial time
• Generalization of the ball-collision algorithm
• Cryptanalysis of Ivanov-Krouk-Zyablov cryptosystem
• Effective attack on the McEliece cryptosystem based on Reed-Muller codes
• A Key Recovery Reaction Attack on QC-MDPC
• A Polynomial-Time Attack on the BBCRS Scheme
• Generalization of BJMM-ISD using May-Ozerov nearest neighbor algorithm over an arbitrary finite field \(\mathbb{F}_q\)
• Cryptanalysis of LEDAcrypt
• Statistical Decoding Revisited
• On the decipherment of Sidel'nikov-type cryptosystems
• Cryptanalysis of the BBCRS system on Reed-Muller binary code
• A study of error floor behavior in QC-MDPC codes

Cited In (2)

• Asymptotics and improvements of sieving for codes
• Construction of quasi-cyclic alternant codes and their application in code-based cryptography

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)