An efficient and parallel Gaussian sampler for lattices. Manuscript, 2010. [PR06] [PR07] Chris Peikert and Alon Rosen. Efficient collision-resistant hashing from worst-case assumptions on cyclic lattices (2006)
| Venue: | In TCC |
| Citations: | 5 - 3 self |
BibTeX
@INPROCEEDINGS{Peikert06anefficient,
author = {Chris Peikert},
title = {An efficient and parallel Gaussian sampler for lattices. Manuscript, 2010. [PR06] [PR07] Chris Peikert and Alon Rosen. Efficient collision-resistant hashing from worst-case assumptions on cyclic lattices},
booktitle = {In TCC},
year = {2006},
pages = {145--166}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
At the heart of many recent lattice-based cryptographic schemes is a polynomial-time algorithm that, given a ‘high-quality ’ basis, generates a lattice point according to a Gaussian-like distribution. Unlike most other operations in lattice-based cryptography, however, the known algorithm for this task (due to Gentry, Peikert, and Vaikuntanathan; STOC 2008) is rather inefficient, and is inherently sequential. We present a new Gaussian sampling algorithm for lattices that is efficient and highly parallelizable. At a high level, the algorithm resembles the “perturbation ” heuristic proposed as part of NTRUSign (Hoffstein et al., CT-RSA 2003), though the details are quite different. To our knowledge, this is the first algorithm and rigorous analysis demonstrating the security of a perturbation-like technique. 1
