A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Gaussian Sampling over the Integers: Efficient, Generic, Constant-Time
[chapter]
2017
Lecture Notes in Computer Science
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
doi:10.1007/978-3-319-63715-0_16
fatcat:z4d7lkqllnhnfeggaz5q4gu3gu