\textsc{Hawk}: module LIP makes lattice signatures fast, compact and simple

DOI10.1007/978-3-031-22972-5_3MaRDI QIDQ6133964zbMATH OpenOpenAlexFDO

Authors Léo Ducas, Eamonn W. Postlethwaite, Ludo N. Pulles, 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

zbMATH Keywords

quadratic formssignaturespost-quantum cryptographyconcrete designmodule lattice isomorphism problem

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Shorter hash-and-sign lattice-based signatures
• Lattice signatures without trapdoors
• High-speed signatures from standard lattices
• Raptor: a practical lattice-based (linkable) ring signature
• Lattice signatures and bimodal Gaussians

Cites work

• 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?)
• 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
• LWE with side information: attacks and concrete security estimation
• 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
• 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 Lovász' lattice reduction and the nearest lattice point problem
• On ideal lattices and learning with errors over rings
• 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
• \textsc{Hawk}: module LIP makes lattice signatures fast, compact and simple
• \textsc{Mitaka}: a simpler, parallelizable, maskable variant of \textsc{Falcon}

Cited in

(15)

• Fast Fourier Orthogonalization over NTRU Lattices
• Monomial isomorphism for tensors and applications to code equivalence problems
• Finding short integer solutions when the modulus is small
• On Gaussian sampling, smoothing parameter and application to signatures
• Exploiting the symmetry of \(\mathbb{Z}^n\): randomization and the automorphism problem
• Fast Falcon signature generation and verification using ARMv8 NEON instructions
• Just how hard are rotations of \(\mathbb{Z}^n\)? Algorithms and cryptography with the simplest lattice
• Algorithms for matrix code and alternating trilinear form equivalences via new isomorphism invariants
• Cryptanalysis of rank-2 module-LIP in totally real number fields
• \textsc{Hawk}: module LIP makes lattice signatures fast, compact and simple
• Hull attacks on the lattice isomorphism problem
• Provable lattice reduction of $$\mathbb {Z}^n$$ with blocksize n/2
• FuLeakage: breaking FuLeeca by learning attacks
• On the Quantum Security of HAWK
• Cryptanalysis of EagleSign

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)