Efficiently masking polynomial inversion at arbitrary order

DOI10.1007/978-3-031-17234-2_15MaRDI QIDQ6166989zbMATH OpenFDO

Authors Markus Krausz, Georg Land, Jan Richter-Brockmann, Tim Güneysu

Publication date 7 July 2023

Published in Post-Quantum Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-17234-2_15

zbMATH Keywords

higher-order maskingmaskingpolynomial inversionPQC

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Nonnumerical algorithms (68W05) Quantum cryptography (quantum-theoretic aspects) (81P94) Channel models (including quantum) in information and communication theory (94A40) Cryptography (94A60)

Recommendations

• Masking large keys in hardware: a masked implementation of McEliece
• Higher-order masked Saber
• Masking Dilithium. Efficient implementation and side-channel evaluation
• How fast can higher-order masking be in software?
• A masked ring-LWE implementation

Cites work

• A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
• A method for obtaining digital signatures and public-key cryptosystems
• Advances in Cryptology - CRYPTO 2003
• Efficiently masking binomial sampling at arbitrary orders for lattice-based crypto
• Folding BIKE: Scalable Hardware Implementation for Reconfigurable Devices
• High-speed key encapsulation from NTRU
• scientific article; zbMATH DE number 3948147 (Why is no real title available?)
• scientific article; zbMATH DE number 1186948 (Why is no real title available?)
• scientific article; zbMATH DE number 1878339 (Why is no real title available?)
• Leakage assessment methodology. A clear roadmap for side-channel evaluations
• NTRU prime: reducing attack surface at low cost
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Towards sound approaches to counteract power-analysis attacks

Cited in

(4)

• Fast polynomial inversion for post quantum QC-MDPC cryptography
• A holistic approach towards side-channel secure fixed-weight polynomial sampling
• \texttt{POLKA}: towards leakage-resistant post-quantum CCA-secure public key encryption
• A provably masked implementation of \textsf{BIKE} key encapsulation mechanism

This page was built for publication: Efficiently masking polynomial inversion at arbitrary order

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