Key recovery from Gram-Schmidt norm leakage in hash-and-sign signatures over NTRU lattices
From MaRDI portal
Publication:2055645
DOI10.1007/978-3-030-45727-3_2zbMath1479.94319OpenAlexW3021798710MaRDI QIDQ2055645
Alexandre Wallet, Yang Yu, Mehdi Tibouchi, Paul Kirchner, Pierre-Alain Fouque
Publication date: 1 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-45727-3_2
Related Items (4)
\textsc{Mitaka}: a simpler, parallelizable, maskable variant of \textsc{Falcon} ⋮ Improved power analysis attacks on Falcon ⋮ Key recovery from Gram-Schmidt norm leakage in hash-and-sign signatures over NTRU lattices ⋮ Exact lattice sampling from non-Gaussian distributions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On Lovász' lattice reduction and the nearest lattice point problem
- LWE without modular reduction and improved side-channel attacks against BLISS
- Masking the GLP lattice-based signature scheme at any order
- Gaussian sampling over the integers: efficient, generic, constant-time
- Flush, Gauss, and reload -- a cache attack on the BLISS lattice-based signature scheme
- A practical implementation of identity-based encryption over NTRU lattices
- Rounded Gaussians -- fast and secure constant-time sampling for lattice-based crypto
- One bit is all it takes: a devastating timing attack on BLISS's non-constant time sign flips
- Key recovery from Gram-Schmidt norm leakage in hash-and-sign signatures over NTRU lattices
- Integral matrix Gram root and lattice Gaussian sampling without floats
- Lattice Signatures and Bimodal Gaussians
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Lattice Signatures without Trapdoors
- Efficient Identity-Based Encryption over NTRU Lattices
- Quadratic Time, Linear Space Algorithms for Gram-Schmidt Orthogonalization and Gaussian Sampling in Structured Lattices
- Fast Fourier Orthogonalization
- Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
- Trapdoors for hard lattices and new cryptographic constructions
- An Efficient and Parallel Gaussian Sampler for Lattices
- Symplectic Lattice Reduction and NTRU
- Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Loop-Abort Faults on Lattice-Based Signatures and Key Exchange Protocols
- Constant-Time Discrete Gaussian Sampling
- Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
- Learning a Zonotope and More: Cryptanalysis of NTRUSign Countermeasures
- An Improved Compression Technique for Signatures Based on Learning with Errors
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Learning strikes again: the case of the DRS signature scheme
This page was built for publication: Key recovery from Gram-Schmidt norm leakage in hash-and-sign signatures over NTRU lattices
