Efficiently masking polynomial inversion at arbitrary order

DOI10.1007/978-3-031-17234-2_15zbMath1517.94121MaRDI QIDQ6166989

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

Publication date: 7 July 2023

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

zbMATH Keywords

maskinghigher-order maskingpolynomial inversionPQC

Mathematics Subject Classification ID

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

Cites Work

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

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