{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,27]],"date-time":"2026-10-27T18:06:27Z","timestamp":1793124387368,"version":"4.5.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T00:00:00Z","timestamp":1278979200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1007\/s00224-010-9278-3","type":"journal-article","created":{"date-parts":[[2010,7,12]],"date-time":"2010-07-12T16:54:55Z","timestamp":1278953695000},"page":"535-553","source":"Crossref","is-referenced-by-count":294,"title":["Generating Shorter Bases for Hard Random Lattices"],"prefix":"10.1007","volume":"48","author":[{"given":"Jo\u00ebl","family":"Alwen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chris","family":"Peikert","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2010,7,13]]},"reference":[{"key":"9278_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Generating hard instances of the short basis problem. In: ICALP, pp.\u00a01\u20139 (1999)","DOI":"10.1007\/3-540-48523-6_1"},{"key":"9278_CR2","first-page":"1","volume":"13","author":"M. Ajtai","year":"2004","unstructured":"Ajtai, M.: Generating hard instances of lattice problems. Quad. Mat. 13, 1\u201332 (2004). Preliminary version in STOC 1996","journal-title":"Quad. Mat."},{"key":"9278_CR3","doi-asserted-by":"crossref","unstructured":"Cash, D., Hofheinz, D., Kiltz, E., Peikert, C.: Bonsai trees, or how to delegate a lattice basis. In: EUROCRYPT, pp.\u00a0523\u2013552 (2010)","DOI":"10.1007\/978-3-642-13190-5_27"},{"key":"9278_CR4","unstructured":"Goldreich, O., Goldwasser, S., Halevi, S.: Collision-free hashing from lattice problems. Electron. Colloq. Comput. Complex. (ECCC) 3(42) (1996)"},{"key":"9278_CR5","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Goldwasser, S., Halevi, S.: Public-key cryptosystems from lattice reduction problems. In: CRYPTO, pp.\u00a0112\u2013131 (1997)","DOI":"10.1007\/BFb0052231"},{"key":"9278_CR6","doi-asserted-by":"crossref","unstructured":"Gentry, C., Halevi, S., Vaikuntanathan, V.: A simple BGN-type cryptosystem from LWE. In: EUROCRYPT, pp.\u00a0506\u2013522 (2010)","DOI":"10.1007\/978-3-642-13190-5_26"},{"key":"9278_CR7","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: STOC, pp.\u00a0197\u2013206 (2008)","DOI":"10.1145\/1374376.1374407"},{"issue":"4","key":"9278_CR8","doi-asserted-by":"crossref","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM J. Comput. 28(4), 1364\u20131396 (1999)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"9278_CR9","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/BF01571276","volume":"110","author":"J.E. Mazo","year":"1990","unstructured":"Mazo, J.E., Odlyzko, A.M.: Lattice points in high-dimensional spheres. Mon. Math. 110(1), 47\u201361 (1990)","journal-title":"Mon. Math."},{"key":"9278_CR10","doi-asserted-by":"crossref","unstructured":"Micciancio, D.: Improving lattice based cryptosystems using the Hermite normal form. In: CaLC, pp.\u00a0126\u2013145 (2001)","DOI":"10.1007\/3-540-44670-2_11"},{"issue":"1","key":"9278_CR11","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1137\/S0097539705447360","volume":"37","author":"D. Micciancio","year":"2007","unstructured":"Micciancio, D., Regev, O.: Worst-case to average-case reductions based on Gaussian measures. SIAM J. Comput. 37(1), 267\u2013302 (2007). Preliminary version in FOCS 2004","journal-title":"SIAM J. Comput."},{"key":"9278_CR12","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/978-3-540-88702-7_5","volume-title":"Post Quantum Cryptography","author":"D. Micciancio","year":"2009","unstructured":"Micciancio, D., Regev, O.: Lattice-based cryptography. In: Post Quantum Cryptography, pp. 147\u2013191. Springer, Berlin (2009)"},{"key":"9278_CR13","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Vadhan, S.P.: Statistical zero-knowledge proofs with efficient provers: Lattice problems and more. In: CRYPTO, pp.\u00a0282\u2013298 (2003)","DOI":"10.1007\/978-3-540-45146-4_17"},{"key":"9278_CR14","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Warinschi, B.: A linear space algorithm for computing the Hermite normal form. In: ISSAC, pp.\u00a0231\u2013236 (2001)","DOI":"10.1145\/384101.384133"},{"key":"9278_CR15","doi-asserted-by":"crossref","unstructured":"Nguyen, P.Q.: Cryptanalysis of the Goldreich-Goldwasser-Halevi cryptosystem from Crypto \u201997. In: CRYPTO, pp.\u00a0288\u2013304 (1999)","DOI":"10.1007\/3-540-48405-1_18"},{"issue":"2","key":"9278_CR16","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.\u00a0Cryptol. 22(2), 139\u2013160 (2009). Preliminary version in Eurocrypt 2006","journal-title":"J.\u00a0Cryptol."},{"key":"9278_CR17","doi-asserted-by":"crossref","unstructured":"Peikert, C.: Public-key cryptosystems from the worst-case shortest vector problem. In: STOC, pp.\u00a0333\u2013342 (2009)","DOI":"10.1145\/1536414.1536461"},{"key":"9278_CR18","doi-asserted-by":"crossref","unstructured":"Peikert, C., Vaikuntanathan, V.: Noninteractive statistical zero-knowledge proofs for lattice problems. In: CRYPTO, pp.\u00a0536\u2013553 (2008)","DOI":"10.1007\/978-3-540-85174-5_30"},{"key":"9278_CR19","doi-asserted-by":"crossref","unstructured":"Peikert, C., Vaikuntanathan, V., Waters, B.: A framework for efficient and composable oblivious transfer. In: CRYPTO, pp.\u00a0554\u2013571 (2008)","DOI":"10.1007\/978-3-540-85174-5_31"},{"key":"9278_CR20","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM 56(6) (2009). Preliminary version in STOC 2005"},{"issue":"5","key":"9278_CR21","doi-asserted-by":"crossref","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P.W. Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5), 1484\u20131509 (1997)","journal-title":"SIAM J. Comput."},{"key":"9278_CR22","unstructured":"Vershynin, R.: Lecture notes on non-asymptotic theory of random matrices (2007). Available at http:\/\/www-personal.umich.edu\/~romanv\/teaching\/2006-07\/280\/ , last accessed 17 Feb. 2010"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-010-9278-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-010-9278-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-010-9278-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:37:11Z","timestamp":1559263031000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-010-9278-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7,13]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,4]]}},"alternative-id":["9278"],"URL":"https:\/\/doi.org\/10.1007\/s00224-010-9278-3","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,7,13]]}}}