\textsc{Hawk}: module LIP makes lattice signatures fast, compact and simple
From MaRDI portal
Publication:6133964
Recommendations
Cites work
- \textsc{Hawk}: module LIP makes lattice signatures fast, compact and simple
- \textsc{Mitaka}: a simpler, parallelizable, maskable variant of \textsc{Falcon}
- An efficient and parallel Gaussian sampler for lattices
- BKZ 2.0: Better lattice security estimates
- Classical hardness of learning with errors
- Fast Fourier orthogonalization
- Faster Gaussian lattice sampling using lazy floating-point arithmetic
- Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
- scientific article; zbMATH DE number 1962147 (Why is no real title available?)
- scientific article; zbMATH DE number 2009972 (Why is no real title available?)
- scientific article; zbMATH DE number 2086714 (Why is no real title available?)
- Lattice attacks on NTRU and LWE: a history of refinements
- Lattice signatures and bimodal Gaussians
- Lattices with symmetry
- Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures
- Learning a zonotope and more: cryptanalysis of ntrusign countermeasures
- LWE with side information: attacks and concrete security estimation
- Measuring, simulating and exploiting the head concavity phenomenon in BKZ
- More efficient algorithms for the NTRU key generation using the field norm
- New bounds in some transference theorems in the geometry of numbers
- On ideal lattices and learning with errors over rings
- On Lovász' lattice reduction and the nearest lattice point problem
- On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography
- On the success probability of solving unique SVP via BKZ
- Run-length encodings (Corresp.)
- Trapdoors for hard lattices and new cryptographic constructions
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
Cited in
(40)- 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
- Fast Fourier Orthogonalization over NTRU Lattices
- Provable lattice reduction of $$\mathbb {Z}^n$$ with blocksize n/2
- On the Quantum Security of HAWK
- Monomial isomorphism for tensors and applications to code equivalence problems
- On Gaussian sampling, smoothing parameter and application to signatures
- Exploiting the symmetry of \(\mathbb{Z}^n\): randomization and the automorphism problem
- Algorithms for matrix code and alternating trilinear form equivalences via new isomorphism invariants
- Cryptanalysis of rank-2 module-LIP in totally real number fields
- FuLeakage: breaking FuLeeca by learning attacks
- Cryptanalysis of EagleSign
- An improvement of the congruence solver of lattice isomorphism problem over totally real number fields and applications
- Cryptanalysis of rank-2 module-LIP: a single real embedding is all it takes
- A reduction from Hawk to the principal ideal problem in a quaternion algebra
- Sampling discrete Gaussian algorithm for Barnes-Wall lattices
- Post-quantum online/offline signatures
- Rank-2 module-LIP with special matrices
- Exploiting the symmetry of \(\mathbb{Z}^n\): randomization and the automorphism problem
- Dense and smooth lattices in any genus
- Cryptanalysis of rank-2 module-LIP with symplectic automorphisms
- On the spinor genus and the distinguishing lattice isomorphism problem
- An improved algorithm for code equivalence
- Hash your keys before signing. BUFF security of the additional NIST PQC signatures
- Improved provable reduction of NTRU and hypercubic lattices
- Properties of lattice isomorphism as a cryptographic group action
- A search to distinguish reduction for the isomorphism problem on direct sum lattices
- Predicting module-lattice reduction
- GPV preimage sampling with weak smoothness and its applications to lattice signatures
- Tanuki: new frameworks for (concurrently secure) blind signatures from post-quantum group actions
- Fully-homomorphic encryption from lattice isomorphism
- Special genera of Hermitian lattices and applications to HAWK
- Post-quantum blind signature from standard group action assumptions and more
- Dimension-reducing algorithms for quaternion ideal-SVP
- RedHAWK: reducing HAWK digital signature stored signing keys
- Diagonally dominant matrices for cryptography
- \textsf{HAWK}: having automorphisms weakens key
This page was built for publication: \textsc{Hawk}: module LIP makes lattice signatures fast, compact and simple
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6133964)
