Gaussian Sampling over the Integers: Efficient, Generic, Constant-Time

Play Gaussian Sampling over the Integers: Efficient, Generic, Constant-Time 
Sign in to queue

Description

Sampling integers with Gaussian distribution is a fundamental problem that arises in almost every application of lattice cryptography, and it can be both time consuming and challenging to implement. Most previous work has focused on the optimization and implementation of integer Gaussian sampling in the context of specific applications, with fixed sets of parameters. We present new algorithms for discrete Gaussian sampling that are both generic (application independent), efficient, and more easily implemented in constant time without incurring a substantial slow-down, making them more resilient to side-channel (e.g., timing) attacks. In the process, we also present new analytical techniques that can be used to simplify the precision/security evaluation of floating point cryptographic algorithms, and showing that standard double precision (53-bit) floating numbers are typically enough to achieve high (>100-bit) level of security. 

Embed

Download

Download this episode

The Discussion

Add Your 2 Cents