Shorter hash-and-sign lattice-based signatures
From MaRDI portal
Publication:6104336
DOI10.1007/978-3-031-15979-4_9zbMath1517.94190MaRDI QIDQ6104336
Mehdi Tibouchi, Alexandre Wallet, Thomas Espitau, Yang Yu
Publication date: 28 June 2023
Published in: Advances in Cryptology – CRYPTO 2022 (Search for Journal in Brave)
Related Items (3)
On rejection sampling in Lyubashevsky's signature scheme ⋮ Finding short integer solutions when the modulus is small ⋮ Compact lattice gadget and its applications to hash-and-sign signatures
Cites Work
- Tweaking the asymmetry of asymmetric-key cryptography on lattices: KEMs and signatures of smaller sizes
- Improved cryptanalysis of UOV and Rainbow
- Fast reduction of algebraic lattices over cyclotomic fields
- \textsc{Mitaka}: a simpler, parallelizable, maskable variant of \textsc{Falcon}
- Approximate trapdoors for lattices and smaller hash-and-sign signatures
- SQISign: compact post-quantum signatures from quaternions and isogenies
- Practical, Predictable Lattice Basis Reduction
- Lattice Signatures and Bimodal Gaussians
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Lattice Signatures without Trapdoors
- Efficient Identity-Based Encryption over NTRU Lattices
- Simple Lattice Trapdoor Sampling from a Broad Class of Distributions
- 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
- Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures
- A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
- New directions in nearest neighbor searching with applications to lattice sieving
- Learning a Zonotope and More: Cryptanalysis of NTRUSign Countermeasures
- The rank of sparse random matrices
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Revisiting Lattice Attacks on Overstretched NTRU Parameters
- The nearest-colattice algorithm: Time-approximation tradeoff for approx-CVP
- On lattices, learning with errors, random linear codes, and cryptography
- Learning strikes again: the case of the DRS signature scheme
- NTRU Fatigue: How Stretched is Overstretched?
- Lattice Sieving via Quantum Random Walks
This page was built for publication: Shorter hash-and-sign lattice-based signatures