About Low DFR for QC-MDPC Decoding

DOI10.1007/978-3-030-44223-1_2OpenAlexW2949110138MaRDI QIDQ5041211

Valentin Vasseur, Nicolas Sendrier

Publication date: 13 October 2022

Published in: Post-Quantum Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-44223-1_2

Mathematics Subject Classification ID

Cryptography (94A60) Theory of error-correcting codes and error-detecting codes (94Bxx) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items

Performance bounds for QC-MDPC codes decoders, Exploring decryption failures of BIKE: new class of weak keys and key recovery attacks

Uses Software

• McEliece
• Backflip

Cites Work

• Unnamed Item
• Unnamed Item
• QC-MDPC: a timing attack and a CCA2 KEM
• 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
• Smaller Keys for Code-Based Cryptography: QC-MDPC McEliece Implementations on Embedded Devices
• An Efficient Pseudo-Random Generator Provably as Secure as Syndrome Decoding
• 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