High-Throughput Hardware Architecture for the SWIFFT / SWIFFTX Hash Functions
Introduced in 1996 and greatly developed over the last few years, Lattice-based cryptography offers a whole set of primitives with nice features, including provable security and asymptotic efficiency. Going from "Asymptotic" to "Real-World" efficiency seems important as the set of available primitives increases in size and functionality. In this paper, the authors explore the improvements that can be obtained through the use of an FPGA architecture for implementing an ideal-lattice based cryptographic primitive. They chose to target two of the simplest, yet powerful and useful, lattice-based primitives, namely the SWIFFT and SWIFFTX primitives. Apart from being simple, those are also of central use for future primitives as Lyubashevsky's lattice-based signatures.