A Note on Discrete Gaussian Combinations of Lattice Vectors

DOI10.4086/cjtcs.2016.007zbMath1375.60062arXiv1308.2405OpenAlexW4233396814MaRDI QIDQ3187176

Divesh Aggarwal, Oded Regev

Publication date: 16 August 2016

Published in: Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1308.2405

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Combinatorial probability (60C05)

Related Items (4)

Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography ⋮ On the smoothing parameter and last minimum of random orthogonal lattices ⋮ Hardness of \(k\)-LWE and applications in traitor tracing ⋮ On a certain class of positive definite functions and measures on locally compact abelian groups and inner-product spaces

Cites Work

• New bounds in some transference theorems in the geometry of numbers
• An Efficient and Parallel Gaussian Sampler for Lattices

This page was built for publication: A Note on Discrete Gaussian Combinations of Lattice Vectors