Fast first-order masked NTTRU
From MaRDI portal
Publication:6088706
DOI10.1007/978-3-031-29497-6_7zbMath1526.94033MaRDI QIDQ6088706
Daniel Heinz, Gabi Dreo Rodosek
Publication date: 16 November 2023
Published in: Constructive Side-Channel Analysis and Secure Design (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- All the AES you need on Cortex-M3 and M4
- Estimate all the {LWE, NTRU} schemes!
- A key-recovery timing attack on post-quantum primitives using the Fujisaki-Okamoto transformation and its application on FrodoKEM
- Faster multiplication in \(\mathbb{Z}_{2^m}[x\) on Cortex-M4 to speed up NIST PQC candidates]
- ChipWhisperer: An Open-Source Platform for Hardware Embedded Security Research
- Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Efficient and Provably Secure Methods for Switching from Arithmetic to Boolean Masking
- Towards sound approaches to counteract power-analysis attacks
- Secure integration of asymmetric and symmetric encryption schemes
- Single-Trace Side-Channel Attacks on Masked Lattice-Based Encryption
- A New Algorithm for Switching from Arithmetic to Boolean Masking
- Secure Conversion between Boolean and Arithmetic Masking of Any Order
- Higher-order masked Saber
- Fault-enabled chosen-ciphertext attacks on Kyber
This page was built for publication: Fast first-order masked NTTRU