An efficient and parallel gaussian sampler for lattices

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6223 LNCS, Issue , 2010, Pages 80-97

  Peikert, Chris ^a  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHIC APPLICATIONS; CRYPTOGRAPHIC SCHEMES; GAUSSIAN SAMPLER; GAUSSIAN-LIKE DISTRIBUTIONS; GAUSSIANS; HIGH QUALITY; LATTICE POINTS; LATTICE-BASED CRYPTOGRAPHY; NTRUSIGN; POLYNOMIAL-TIME ALGORITHMS; RIGOROUS ANALYSIS; SAMPLING ALGORITHM;

ALGORITHMS; GAUSSIAN DISTRIBUTION; PERTURBATION TECHNIQUES; SAMPLING;

CRYPTOGRAPHY;

EID: 77956996919     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14623-7_5     Document Type: Conference Paper

References (21)

1. Agrawal, S., Boneh, D., Boyen, X.: Efficient lattice (H)IBE in the standard model. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 553-572. Springer, Heidelberg (2010)
2. Ajtai, M.: Generating hard instances of the short basis problem. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 1-9. Springer, Heidelberg (1999)
3. Ajtai, M.: Generating hard instances of lattice problems. Quaderni di Matematica 13, 1-32 (2004); Preliminary version in STOC 1996 (1996)
4. Alwen, J., Peikert, C.: Generating shorter bases for hard random lattices. In: STACS, pp. 75-86 (2009)
5. Babai, L.: On Lovász' lattice reduction and the nearest lattice point problem. Combinatorica 6(1), 1-13 (1986)
6. Cash, D., Hofheinz, D., Kiltz, E., Peikert, C.: Bonsai trees, or how to delegate a lattice basis. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 523-552. Springer, Heidelberg (2010)
7. Gentry, C.: Fully homomorphic encryption using ideal lattices. In: STOC, pp. 169-178 (2009)
8. Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: STOC, pp. 197-206 (2008)
9. Hoffstein, J., Howgrave-Graham, N., Pipher, J., Silverman, J.H., Whyte, W.: NTRUSIGN: Digital signatures using the NTRU lattice. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol. 2612, pp. 122-140. Springer, Heidelberg (2003)
10. Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: A ring-based public key cryp-tosystem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol. 1423, pp. 267-288. Springer, Heidelberg (1998)
11. Klein, P.N.: Finding the closest lattice vector when it's unusually close. In: SODA, pp. 937-941 (2000)
12. Kshirsagar, A.M.: Bartlett decomposition and Wishart distribution. The Annals of Mathematical Statistics 30(1), 239-241 (1959), http://www.jstor.org/ stable/2237140
13. Lyubashevsky, V., Micciancio, D.: Asymptotically efficient lattice-based digital signatures. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 37-54. Springer, Heidelberg (2008)
14. Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 1-23. Springer, Heidelberg (2010)
15. Malkin, T., Peikert, C., Servedio, R.A., Wan, A.: Learning an overcomplete basis: Analysis of lattice-based signatures with perturbations (2009) (manuscript)
16. Micciancio, D.: Generalized compact knapsacks, cyclic lattices, and efficient oneway functions. Computational Complexity 16(4), 365-411 (2007); Preliminary version in FOCS 2002 (2002)
17. Micciancio, D., Regev, O.: Worst-case to average-case reductions based on Gaussian measures. SIAM J. Comput. 37(1), 267-302 (2007); Preliminary version in FOCS 2004 (2004)
18. Nguyen, P.Q., Regev, O.: Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures. J. Cryptology 22(2), 139-160 (2009); Preliminary version in Eurocrypt 2006 (2006)
19. Peikert, C., Vaikuntanathan, V.: Noninteractive statistical zero-knowledge proofs for lattice problems. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 536-553. Springer, Heidelberg (2008)
20. Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM 56(6) (2009); Preliminary version in STOC 2005 (2005)
21. Stehlé, D., Steinfeld, R., Tanaka, K., Xagawa, K.: Efficient public key encryption based on ideal lattices. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 617-635. Springer, Heidelberg (2009)