On constant-time QC-MDPC decoders with negligible failure rate

DOI10.1007/978-3-030-54074-6_4zbMath1459.94109OpenAlexW2990146978MaRDI QIDQ2221107

Nir Drucker, Dusan Kostic, Shay Gueron

Publication date: 26 January 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-54074-6_4

zbMATH Keywords

constant-time algorithmIND-CCAQC-MDPC codesBIKEconstant-time implementation

Mathematics Subject Classification ID

Cryptography (94A60) Decoding (94B35)

Related Items (6)

About Low DFR for QC-MDPC Decoding ⋮ QC-MDPC Decoders with Several Shades of Gray ⋮ Decryption Failure Is More Likely After Success ⋮ A study of error floor behavior in QC-MDPC codes ⋮ Exploring decryption failures of BIKE: new class of weak keys and key recovery attacks ⋮ Backflip

Uses Software

• NTL
• McEliece
• gf2x
• BIKE

This page was built for publication: On constant-time QC-MDPC decoders with negligible failure rate