A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Discrete Gaussian Sampling Reduces to CVP and SVP
[article]
2016
arXiv
pre-print
The discrete Gaussian D_L- t, s is the distribution that assigns to each vector x in a shifted lattice L - t probability proportional to e^-πx^2/s^2. It has long been an important tool in the study of lattices. More recently, algorithms for discrete Gaussian sampling (DGS) have found many applications in computer science. In particular, polynomial-time algorithms for DGS with very high parameters s have found many uses in cryptography and in reductions between lattice problems. And, in the past
arXiv:1506.07490v4
fatcat:kpxdpcpsfzdcjpedbtehgczrse