\textsc{Hawk}: module LIP makes lattice signatures fast, compact and simple
From MaRDI portal
Publication:6133964
DOI10.1007/978-3-031-22972-5_3zbMath1519.94220OpenAlexW4317928325MaRDI QIDQ6133964
Ludo N. Pulles, Eamonn W. Postlethwaite, Léo Ducas, Wessel P. J. van Woerden
Publication date: 21 August 2023
Published in: Advances in Cryptology – ASIACRYPT 2022 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-22972-5_3
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items (5)
Just how hard are rotations of \(\mathbb{Z}^n\)? Algorithms and cryptography with the simplest lattice ⋮ Hull attacks on the lattice isomorphism problem ⋮ \textsc{Hawk}: module LIP makes lattice signatures fast, compact and simple ⋮ Finding short integer solutions when the modulus is small ⋮ Fast Falcon signature generation and verification using ARMv8 NEON instructions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures
- On Lovász' lattice reduction and the nearest lattice point problem
- New bounds in some transference theorems in the geometry of numbers
- Measuring, simulating and exploiting the head concavity phenomenon in BKZ
- Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
- On the success probability of solving unique SVP via BKZ
- LWE with side information: attacks and concrete security estimation
- \textsc{Mitaka}: a simpler, parallelizable, maskable variant of \textsc{Falcon}
- On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography
- More efficient algorithms for the NTRU key generation using the field norm
- Lattices with symmetry
- Lattice Signatures and Bimodal Gaussians
- Fast Fourier Orthogonalization
- BKZ 2.0: Better Lattice Security Estimates
- Trapdoors for hard lattices and new cryptographic constructions
- On Ideal Lattices and Learning with Errors over Rings
- An Efficient and Parallel Gaussian Sampler for Lattices
- Faster Gaussian Lattice Sampling Using Lazy Floating-Point Arithmetic
- Learning a Zonotope and More: Cryptanalysis of NTRUSign Countermeasures
- Lattice Attacks on NTRU and LWE: A History of Refinements
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Classical hardness of learning with errors
- Run-length encodings (Corresp.)
- \textsc{Hawk}: module LIP makes lattice signatures fast, compact and simple
This page was built for publication: \textsc{Hawk}: module LIP makes lattice signatures fast, compact and simple
