Fast polynomial inversion for post quantum QC-MDPC cryptography

DOI10.1016/J.IC.2021.104799MaRDI QIDQ2051829zbMATH OpenOpenAlexFDO

Authors Nir Drucker, Shay Gueron, Dusan Kostic

Publication date 25 November 2021

Published in Information and Computation (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1016/j.ic.2021.104799

zbMATH Keywords

BIKEconstant-time algorithmconstant-time implementationNIST PQC round-3polynomial inversionQC-MDPC codes

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Efficiently masking polynomial inversion at arbitrary order
• On constant-time QC-MDPC decoders with negligible failure rate
• QC-MDPC decoders with several shades of gray
• Introducing arithmetic failures to accelerate QC-MDPC code-based cryptography
• On the decoding failure rate of QC-MDPC bit-flipping decoders

Cites work

• A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
• ECC2K-130 on Cell CPUs
• High-speed key encapsulation from NTRU
• scientific article; zbMATH DE number 3989251 (Why is no real title available?)
• On the decoding failure rate of QC-MDPC bit-flipping decoders

Cited in

(5)

• Performance bounds for QC-MDPC codes decoders
• A study of error floor behavior in QC-MDPC codes
• Introducing arithmetic failures to accelerate QC-MDPC code-based cryptography
• BIKE key-recovery: combining power consumption analysis and information-set decoding
• Exploring quasi-geometric frameworks for quantum error-correcting codes: a systematic review

Describes a project that uses

Uses Software

• gf2x
• Backflip
• BIKE
• McEliece
• LEDAcrypt
• NTL
• OpenSSL

This page was built for publication: Fast polynomial inversion for post quantum QC-MDPC cryptography

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