Fast polynomial inversion for post quantum QC-MDPC cryptography
type: Item
instance of: scholarly article
title: Fast polynomial inversion for post quantum QC-MDPC cryptography
author: Nir Drucker
author: Shay Gueron
author: Dusan Kostic
published in: Information and Computation
publication date: 2021-11-25T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7433319
zbMATH Keywords: polynomial inversion
zbMATH Keywords: BIKE
zbMATH Keywords: QC-MDPC codes
zbMATH Keywords: constant-time algorithm
zbMATH Keywords: constant-time implementation
zbMATH Keywords: NIST PQC round-3
describes a project that uses: gf2x
describes a project that uses: Backflip
describes a project that uses: BIKE
describes a project that uses: McEliece
describes a project that uses: LEDAcrypt
describes a project that uses: NTL
describes a project that uses: OpenSSL
MaRDI profile type: Publication
full work available at URL: j.ic.2021.104799
OpenAlex ID: W3037722325
cites work: Q3752293
cites work: High-Speed Key Encapsulation from NTRU
cites work: A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
cites work: ECC2K-130 on Cell CPUs
cites work: On the decoding failure rate of QC-MDPC bit-flipping decoders
DOI: 10.1016/J.IC.2021.104799
description: scientific article; zbMATH DE number 7433319