{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T10:38:34Z","timestamp":1772620714143,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642146220","type":"print"},{"value":"9783642146237","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14623-7_5","type":"book-chapter","created":{"date-parts":[[2010,8,10]],"date-time":"2010-08-10T08:15:26Z","timestamp":1281428126000},"page":"80-97","source":"Crossref","is-referenced-by-count":241,"title":["An Efficient and Parallel Gaussian Sampler for Lattices"],"prefix":"10.1007","author":[{"given":"Chris","family":"Peikert","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/978-3-642-13190-5_28","volume-title":"EUROCRYPT 2010","author":"S. Agrawal","year":"2010","unstructured":"Agrawal, S., Boneh, D., Boyen, X.: Efficient lattice (H)IBE in the standard model. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol.\u00a06110, pp. 553\u2013572. Springer, Heidelberg (2010)"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-48523-6_1","volume-title":"Automata, Languages and Programming","author":"M. Ajtai","year":"1999","unstructured":"Ajtai, M.: Generating hard instances of the short basis problem. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol.\u00a01644, pp. 1\u20139. Springer, Heidelberg (1999)"},{"key":"5_CR3","first-page":"1","volume":"13","author":"M. Ajtai","year":"2004","unstructured":"Ajtai, M.: Generating hard instances of lattice problems. Quaderni di Matematica\u00a013, 1\u201332 (2004); Preliminary version in STOC 1996 (1996)","journal-title":"Quaderni di Matematica"},{"key":"5_CR4","unstructured":"Alwen, J., Peikert, C.: Generating shorter bases for hard random lattices. In: STACS, pp. 75\u201386 (2009)"},{"issue":"1","key":"5_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02579403","volume":"6","author":"L. Babai","year":"1986","unstructured":"Babai, L.: On Lov\u00e1sz\u2019 lattice reduction and the nearest lattice point problem. Combinatorica\u00a06(1), 1\u201313 (1986)","journal-title":"Combinatorica"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/978-3-642-13190-5_27","volume-title":"EUROCRYPT 2010","author":"D. Cash","year":"2010","unstructured":"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.\u00a06110, pp. 523\u2013552. Springer, Heidelberg (2010)"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: STOC, pp. 169\u2013178 (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: STOC, pp. 197\u2013206 (2008)","DOI":"10.1145\/1374376.1374407"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/3-540-36563-X_9","volume-title":"Topics in Cryptology - CT-RSA 2003","author":"J. Hoffstein","year":"2003","unstructured":"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.\u00a02612, pp. 122\u2013140. Springer, Heidelberg (2003)"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BFb0054868","volume-title":"Algorithmic Number Theory","author":"J. Hoffstein","year":"1998","unstructured":"Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: A ring-based public key cryptosystem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol.\u00a01423, pp. 267\u2013288. Springer, Heidelberg (1998)"},{"key":"5_CR11","unstructured":"Klein, P.N.: Finding the closest lattice vector when it\u2019s unusually close. In: SODA, pp. 937\u2013941 (2000)"},{"issue":"1","key":"5_CR12","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1214\/aoms\/1177706379","volume":"30","author":"A.M. Kshirsagar","year":"1959","unstructured":"Kshirsagar, A.M.: Bartlett decomposition and Wishart distribution. The Annals of Mathematical Statistics\u00a030(1), 239\u2013241 (1959), http:\/\/www.jstor.org\/stable\/2237140","journal-title":"The Annals of Mathematical Statistics"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-540-78524-8_3","volume-title":"Theory of Cryptography","author":"V. Lyubashevsky","year":"2008","unstructured":"Lyubashevsky, V., Micciancio, D.: Asymptotically efficient lattice-based digital signatures. In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, pp. 37\u201354. Springer, Heidelberg (2008)"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-13190-5_1","volume-title":"EUROCRYPT 2010","author":"V. Lyubashevsky","year":"2010","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol.\u00a06110, pp. 1\u201323. Springer, Heidelberg (2010)"},{"key":"5_CR15","unstructured":"Malkin, T., Peikert, C., Servedio, R.A., Wan, A.: Learning an overcomplete basis: Analysis of lattice-based signatures with perturbations (2009) (manuscript)"},{"issue":"4","key":"5_CR16","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/s00037-007-0234-9","volume":"16","author":"D. Micciancio","year":"2007","unstructured":"Micciancio, D.: Generalized compact knapsacks, cyclic lattices, and efficient one-way functions. Computational Complexity\u00a016(4), 365\u2013411 (2007); Preliminary version in FOCS 2002 (2002)","journal-title":"Computational Complexity"},{"key":"#cr-split#-5_CR17.1","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Regev, O.: Worst-case to average-case reductions based on Gaussian measures. SIAM J. Comput.??37(1), 267???302 (2007);","DOI":"10.1137\/S0097539705447360"},{"key":"#cr-split#-5_CR17.2","unstructured":"Preliminary version in FOCS 2004 (2004)"},{"issue":"2","key":"5_CR18","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/s00145-008-9031-0","volume":"22","author":"P.Q. Nguyen","year":"2009","unstructured":"Nguyen, P.Q., Regev, O.: Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures. J. Cryptology\u00a022(2), 139\u2013160 (2009); Preliminary version in Eurocrypt 2006 (2006)","journal-title":"J. Cryptology"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"536","DOI":"10.1007\/978-3-540-85174-5_30","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"C. Peikert","year":"2008","unstructured":"Peikert, C., Vaikuntanathan, V.: Noninteractive statistical zero-knowledge proofs for lattice problems. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 536\u2013553. Springer, Heidelberg (2008)"},{"key":"#cr-split#-5_CR20.1","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM??56(6) (2009);","DOI":"10.1145\/1568318.1568324"},{"key":"#cr-split#-5_CR20.2","unstructured":"Preliminary version in STOC 2005 (2005)"},{"key":"5_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/978-3-642-10366-7_36","volume-title":"ASIACRYPT 2009","author":"D. Stehl\u00e9","year":"2009","unstructured":"Stehl\u00e9, D., Steinfeld, R., Tanaka, K., Xagawa, K.: Efficient public key encryption based on ideal lattices. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol.\u00a05912, pp. 617\u2013635. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14623-7_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:55:45Z","timestamp":1606186545000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14623-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642146220","9783642146237"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14623-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}