Polynomial inversion algorithms in constant time for post-quantum cryptography

DOI10.1007/978-3-031-80311-6_12MaRDI QIDQ6955319zbMATH OpenFDO

Authors Abhraneel Dutta, Emrah Karagoz, Edoardo Persichetti, Pakize Sanal

Publication date 23 July 2025

Full work available at URL https://doi.org/10.1007/978-3-031-80311-6_12

zbMATH Keywords

constant timepolynomial inversionpost-quantumQC-MDPC

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Quantum cryptography (quantum-theoretic aspects) (81P94) Cryptography (94A60)

Cites work

• A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
• A fast algorithm for multiplicative inversion in GF(2/sup m/) using normal basis
• An improvement of the TYT algorithm for \(\mathrm{GF}(2^m)\) based on reusing intermediate computation results
• LEDAcrypt: QC-LDPC code-based cryptosystems with bounded decryption failure rate

This page was built for publication: Polynomial inversion algorithms in constant time for post-quantum cryptography

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