HAWK: Module LIP makes lattice signatures fast, compact and simple
We propose the signature scheme Hawk, a concrete instantiation of proposals to use the Lattice Isomorphism Problem (LIP) as a foundation for cryptography that focuses on simplicity. This simplicity stems from LIP, which allows the use of lattices such as Zn , leading to signature algorithms with no floats, no rejection sampling, and compact precomputed distributions. Such design features are desirable for constrained devices, and when computing signatures inside FHE or MPC. The most significant change from recent LIP proposals is the use of module lattices, reusing algorithms and ideas from NTRUSign and Falcon. Its simplicity makes Hawk competitive. We provide cryptanalysis with experimental evidence for the design of Hawk and implement two parameter sets, Hawk-512 and Hawk-1024. Signing using Hawk-512 and Hawk-1024 is four times faster than Falcon on x86 architectures, produces signatures that are about 15% more compact, and is slightly more secure against forgeries by lattice reduction attacks. When floating-points are unavailable, Hawk signs 15 times faster than Falcon. We provide a worst case to average case reduction for module LIP. For certain parametrisations of Hawk this applies to secret key recovery and we reduce signature forgery in the random oracle model to a new problem called the one more short vector problem.
|, , ,
|Lecture Notes in Computer Science
|Algebraic Methods for Stronger Crypto , PRivacy preserving pOst-quantuM systEms from advanced crypTograpHic mEchanisms Using latticeS , A Reduction Theory for Codes and Lattices in Cryptography
Ducas, L., Postlethwaite, E. W., Pulles, L., & van Woerden, W. (2022). HAWK: Module LIP makes lattice signatures fast, compact and simple. In Advances in Cryptology (pp. 65–94). doi:10.1007/978-3-031-22972-5_3