Fast first-order masked NTTRU
From MaRDI portal
Recommendations
Cites work
- A key-recovery timing attack on post-quantum primitives using the Fujisaki-Okamoto transformation and its application on FrodoKEM
- A new algorithm for switching from arithmetic to Boolean masking.
- All the AES you need on Cortex-M3 and M4
- Chipwhisperer: an open-source platform for hardware embedded security research
- Efficient and provably secure methods for switching from arithmetic to Boolean masking
- Estimate all the \(\{\)LWE, NTRU\(\}\) schemes!
- Faster multiplication in \(\mathbb{Z}_{2^m}[x]\) on Cortex-M4 to speed up NIST PQC candidates
- Fault-enabled chosen-ciphertext attacks on Kyber
- Higher-order masked Saber
- scientific article; zbMATH DE number 1186948 (Why is no real title available?)
- scientific article; zbMATH DE number 1878319 (Why is no real title available?)
- scientific article; zbMATH DE number 1418307 (Why is no real title available?)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Secure conversion between Boolean and arithmetic masking of any order
- Secure integration of asymmetric and symmetric encryption schemes
- Single-trace side-channel attacks on masked lattice-based encryption
- Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems
- Towards sound approaches to counteract power-analysis attacks
This page was built for publication: Fast first-order masked NTTRU
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6088706)