Efficiently masking polynomial inversion at arbitrary order

DOI10.1007/978-3-031-17234-2_15zbMATH Open1517.94121MaRDI QIDQ6166989FDOQ6166989

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)

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

zbMATH Keywords

maskinghigher-order maskingpolynomial inversionPQC

Mathematics Subject Classification ID

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

Cites Work

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

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)