| Document Date: 2011-04-13 22:31:57
Open Document File Size: 398,10 KBShare Result on Facebook
Company BP / / / Facility College of Computing / Georgia Institute of Technology / / IndustryTerm prior sampling algorithm / nearest-plane algorithm / inner product / cryptographic applications / basisgeneration algorithms / computer processors / randomized nearest-plane algorithm / randomized-rounding algorithm / polynomial-time algorithm / the√ algorithms / online phase / optimized sampling algorithm / sound cryptographic applications / lattice decoding algorithm / randomized simple-rounding algorithm / / Organization School of Computer Science / National Science Foundation / Georgia Institute of Technology / College of Computing / / Person Chris Peikert∗ April / Bt / / / Position author / / Technology sampling algorithm / cryptography / sampling algorithms / lattice decoding algorithm / prior GPV algorithm / the√ algorithms / two known sampling algorithms / Algorithm The GPV sampling algorithm / simplerounding algorithm / Gaussian sampling algorithm / polynomial-time algorithm / nearest-plane algorithm / randomized nearest-plane algorithm / identity-based encryption / B. The GPV algorithm / basisgeneration algorithms / known algorithm / optimized sampling algorithm / n2 processors / GPV algorithm / key-generation algorithm / randomized-rounding algorithm / Gaussian Sampling Algorithms / computer processors / prior sampling algorithm / two algorithms / /
SocialTag |
An Efficient and Parallel Gaussian Sampler for Lattices Chris Peikert∗ April 13, 2011 Abstract At the heart of many recent lattice-based cryptographic schemes is a polynomial-time algorithm that,