...
首页> 外文期刊>Chicago Journal of Theoretical Computer Science >A Note on Discrete Gaussian Combinations of Lattice Vectors
【24h】

A Note on Discrete Gaussian Combinations of Lattice Vectors

机译:关于格向量离散高斯组合的一个注记

获取原文
   

获取外文期刊封面封底 >>

       

摘要

We prove a local central limit theorem for the sum of one-dimensional discrete Gaussians in $n$-dimensional space. In more detail, we analyze the distribution of $sum_{i=1}^m v_i mathbf{x}_i$ where $mathbf{x}_1,ldots,mathbf{x}_m$ are fixed vectors from some lattice $mathcal{L} subset mathbb{R}^n$ and $v_1,ldots,v_m$ are chosen independently from a discrete Gaussian distribution over $mathbb{Z}$. We show that under a natural constraint on $mathbf{x}_1,ldots,mathbf{x}_m$, if the $v_i$ are chosen from a wide enough Gaussian, the sum is statistically close to a discrete Gaussian over $mathcal{L}$. We also analyze the case of $mathbf{x}_1,ldots,mathbf{x}_m$ 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
机译:我们证明了$ n $维空间中一维离散高斯和的和的局部中心极限定理。更详细地讲,我们分析$ sum_ {i = 1} ^ m v_i mathbf {x} _i $的分布,其中$ mathbf {x} _1, ldots, mathbf {x} _m $是来自从$ mathbb {Z} $上的离散高斯分布中独立选择一些点阵$ mathcal {L} subset mathbb {R} ^ n $和$ v_1, ldots,v_m $。我们证明,在对$ mathbf {x} _1, ldots, mathbf {x} _m $的自然约束下,如果$ v_i $是从足够宽的高斯中选择的,则该和在统计上接近于离散高斯$ mathcal {L} $。我们还分析了$ mathbf {x} _1, ldots, mathbf {x} _m $的情况,它们本身是从离散的高斯分布中选择的(固定的)。根据Agrawal,Gentry,Halevi和Sahai的最新结果,我们的结果简化了并在质量上进行了改进

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号