A Note on Discrete Gaussian Combinations of Lattice Vectors
Cryptography and Security
2014-01-13 v2 Combinatorics
Probability
Abstract
We analyze the distribution of where are fixed vectors from some lattice (say ) and are chosen independently from a discrete Gaussian distribution over . We show that under a natural constraint on , if the are chosen from a wide enough Gaussian, the sum is statistically close to a discrete Gaussian over . We also analyze the case of that are themselves chosen from a discrete Gaussian distribution (and fixed). Our results simplify and qualitatively improve upon a recent result by Agrawal, Gentry, Halevi, and Sahai \cite{AGHS13}.
Keywords
Cite
@article{arxiv.1308.2405,
title = {A Note on Discrete Gaussian Combinations of Lattice Vectors},
author = {Divesh Aggarwal and Oded Regev},
journal= {arXiv preprint arXiv:1308.2405},
year = {2014}
}