Introducing arithmetic failures to accelerate QC-MDPC code-based cryptography

DOI10.1007/978-3-030-25922-8_3MaRDI QIDQ6199258zbMATH OpenOpenAlexFDO

Authors Antonio C. F. Guimarães, Edson Borin, Diego F. Aranha

Publication date 23 February 2024

Published in Code-Based Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-25922-8_3

zbMATH Keywords

code-based cryptographyfailure insertionGC-MDPCpolynomial inversionpolynomial multiplication

Mathematics Subject Classification ID

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

Recommendations

• On the decoding failure rate of QC-MDPC bit-flipping decoders
• QC-MDPC: a timing attack and a CCA2 KEM
• Fast polynomial inversion for post quantum QC-MDPC cryptography
• On constant-time QC-MDPC decoders with negligible failure rate
• QC-MDPC decoders with several shades of gray

Cited in

(1)

• Fast polynomial inversion for post quantum QC-MDPC cryptography

This page was built for publication: Introducing arithmetic failures to accelerate QC-MDPC code-based cryptography

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6199258)