Lattice Signatures and Bimodal Gaussians

Provided by: International Association for Cryptologic Research
Topic: Security
Format: PDF
The authors' main result is a construction of a lattice-based digital signature scheme that represents an improvement, both in theory and in practice, over today's most efficient lattice schemes. The novel scheme is obtained as a result of a modification of the rejection sampling algorithm that is at the heart of Lyubashevsky's signature scheme (Eurocrypt, 2012) and several other lattice primitives. Their new rejection sampling algorithm which samples from a bimodal gaussian distribution, combined with a modified scheme instantiation, ends up reducing the standard deviation of the resulting signatures by a factor that is asymptotically square root in the security parameter.

Find By Topic