Fast polynomial inversion for post quantum QC-MDPC cryptography

DOI10.1016/j.ic.2021.104799OpenAlexW3037722325MaRDI QIDQ2051829

Shay Gueron, Dusan Kostic, Nir Drucker

Publication date: 25 November 2021

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

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

zbMATH Keywords

constant-time algorithmpolynomial inversionQC-MDPC codesBIKEconstant-time implementationNIST PQC round-3

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

Performance bounds for QC-MDPC codes decoders ⋮ A study of error floor behavior in QC-MDPC codes

Uses Software

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

Cites Work

• Unnamed Item
• A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
• On the decoding failure rate of QC-MDPC bit-flipping decoders
• ECC2K-130 on Cell CPUs
• High-Speed Key Encapsulation from NTRU

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