{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,9]],"date-time":"2026-11-09T17:50:53Z","timestamp":1794246653226,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642131899","type":"print"},{"value":"9783642131905","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13190-5_13","type":"book-chapter","created":{"date-parts":[[2010,5,19]],"date-time":"2010-05-19T13:16:46Z","timestamp":1274275006000},"page":"257-278","source":"Crossref","is-referenced-by-count":181,"title":["Lattice Enumeration Using Extreme Pruning"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Gama","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Phong Q.","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Oded","family":"Regev","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"8","key":"13_CR1","doi-asserted-by":"publisher","first-page":"2201","DOI":"10.1109\/TIT.2002.800499","volume":"48","author":"E. Agrell","year":"2002","unstructured":"Agrell, E., Eriksson, T., Vardy, A., Zeger, K.: Closest point search in lattices. IEEE Trans. on Info. Theory\u00a048(8), 2201\u20132214 (2002)","journal-title":"IEEE Trans. on Info. Theory"},{"issue":"5","key":"13_CR2","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1145\/1089023.1089025","volume":"52","author":"D. Aharonov","year":"2005","unstructured":"Aharonov, D., Regev, O.: Lattice problems in NP intersect coNP. Journal of the ACM\u00a052(5), 749\u2013765 (2005); Preliminary version in FOCS 2004","journal-title":"Journal of the ACM"},{"key":"13_CR3","unstructured":"Ajtai, M.: Generating random lattices according to the invariant distribution (Draft) (March 2006)"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Kumar, R., Sivakumar, D.: A sieve algorithm for the shortest lattice vector problem. In: Proc. 33rd ACM Symp. on Theory of Computing (STOC), pp. 601\u2013610 (2001)","DOI":"10.1145\/380752.380857"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Kumar, R., Sivakumar, D.: Sampling short lattice vectors and the closest lattice vector problem. In: Proc. of 17th IEEE Annual Conference on Computational Complexity (CCC), pp. 53\u201357 (2002)","DOI":"10.1109\/CCC.2002.1004339"},{"key":"13_CR6","unstructured":"Cad\u00e9, D., Pujol, X., Stehl\u00e9, D.: FPLLL library, version 3.0 (September 2008), http:\/\/perso.ens-lyon.fr\/damien.stehle"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Coster, M., Joux, A., LaMacchina, B., Odlyzko, A., Schnorr, C., Stern, J.: An improved low-density subset sum algorithm. In: Computational Complexity (1992)","DOI":"10.1007\/BF01201999"},{"key":"13_CR8","unstructured":"Dasgupta, S., Gupta, A.: An elementary proof of the Johnson-Lindenstrauss lemma. Technical report, ICSI, Berkeley, TR-99-006 (1999)"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Devroye, L.: Non-uniform random variate generation (1986), http:\/\/cg.scs.carleton.ca\/~luc\/rnbookindex.html","DOI":"10.1007\/978-1-4613-8643-8"},{"issue":"1","key":"13_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/102782.102783","volume":"38","author":"M. Dyer","year":"1991","unstructured":"Dyer, M., Frieze, A., Kannan, R.: A random polynomial-time algorithm for approximating the volume of convex bodies. J. ACM\u00a038(1), 1\u201317 (1991)","journal-title":"J. ACM"},{"issue":"170","key":"13_CR11","doi-asserted-by":"publisher","first-page":"463","DOI":"10.2307\/2007966","volume":"44","author":"U. Fincke","year":"1985","unstructured":"Fincke, U., Pohst, M.: Improved methods for calculating vectors of short length in a lattice, including a complexity analysis. Mathematics of Computation\u00a044(170), 463\u2013471 (1985)","journal-title":"Mathematics of Computation"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Gama, N., Nguyen, P.Q.: Finding short lattice vectors within Mordell\u2019s inequality. In: Proc. 40th ACM Symp. on Theory of Computing, STOC (2008)","DOI":"10.1145\/1374376.1374408"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-78967-3_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"N. Gama","year":"2008","unstructured":"Gama, N., Nguyen, P.Q.: Predicting Lattice Reduction. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 31\u201351. Springer, Heidelberg (2008)"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-540-74143-5_10","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"G. Hanrot","year":"2007","unstructured":"Hanrot, G., Stehl\u00e9, D.: Improved analysis of Kannan\u2019s shortest lattice vector algorithm (extended abstract). In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622, pp. 170\u2013186. Springer, Heidelberg (2007)"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"H\u00e5stad, J., Just, B., Lagarias, J.C., Schnorr, C.-P.: Polynomial time algorithms for finding integer relations among real numbers. SIAM J. Comput.\u00a018(5) (1989)","DOI":"10.1137\/0218059"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Kannan, R.: Improved algorithms for integer programming and related lattice problems. In: Proc. 15th ACM Symp. on Theory of Computing, STOC (1983)","DOI":"10.1145\/800061.808749"},{"key":"13_CR17","first-page":"513","volume":"261","author":"A.K. Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra Jr., H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Mathematische Ann.\u00a0261, 513\u2013534 (1982)","journal-title":"Mathematische Ann."},{"issue":"2","key":"13_CR18","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1016\/j.jcss.2005.08.004","volume":"72","author":"L. Lov\u00e1sz","year":"2006","unstructured":"Lov\u00e1sz, L., Vempala, S.: Simulated annealing in convex bodies and an O *(n 4) volume algorithm. J. Comput. Syst. Sci.\u00a072(2), 392\u2013417 (2006)","journal-title":"J. Comput. Syst. Sci."},{"key":"13_CR19","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/BF01571276","volume":"17","author":"J.E. Mazo","year":"1990","unstructured":"Mazo, J.E., Odlyzko, A.M.: Lattice points in high dimensional spheres. Monatsheft Mathematik\u00a017, 47\u201361 (1990)","journal-title":"Monatsheft Mathematik"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Voulgaris, P.: A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations. In: Proc. 42nd ACM Symp. on Theory of Computing, STOC (2010)","DOI":"10.1145\/1806689.1806739"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Voulgaris, P.: Faster exponential time algorithms for the shortest vector problem. In: Proc. ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 1468\u20131480 (2010)","DOI":"10.1137\/1.9781611973075.119"},{"key":"13_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1007\/3-540-48405-1_18","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"P.Q. Nguyen","year":"1999","unstructured":"Nguyen, P.Q.: Cryptanalysis of the Goldreich-Goldwasser-Halevi cryptosystem from Crypto 1997. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 288\u2013304. Springer, Heidelberg (1999)"},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"Nguyen, P.Q.: Public-key cryptanalysis. In: Luengo, I. (ed.) Recent Trends in Cryptography. Contemporary Mathematics, vol.\u00a0477. AMS\u2013RSME (2009)","DOI":"10.1090\/conm\/477\/09304"},{"key":"13_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/11792086_18","volume-title":"Algorithmic Number Theory","author":"P.Q. Nguyen","year":"2006","unstructured":"Nguyen, P.Q., Stehl\u00e9, D.: LLL on the average. In: Hess, F., Pauli, S., Pohst, M. (eds.) ANTS 2006. LNCS, vol.\u00a04076, pp. 238\u2013256. Springer, Heidelberg (2006)"},{"key":"13_CR25","series-title":"Information Security and Cryptography","volume-title":"The LLL Algorithm: Survey and Applications","year":"2009","unstructured":"Nguyen, P.Q., Vall\u00e9e, B. (eds.): The LLL Algorithm: Survey and Applications. Information Security and Cryptography. Springer, Heidelberg (2009)"},{"issue":"2","key":"13_CR26","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1515\/JMC.2008.009","volume":"2","author":"P.Q. Nguyen","year":"2008","unstructured":"Nguyen, P.Q., Vidick, T.: Sieve algorithms for the shortest vector problem are practical. J. of Mathematical Cryptology\u00a02(2), 181\u2013207 (2008)","journal-title":"J. of Mathematical Cryptology"},{"issue":"1","key":"13_CR27","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1145\/1089242.1089247","volume":"15","author":"M. Pohst","year":"1981","unstructured":"Pohst, M.: On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications. SIGSAM Bull.\u00a015(1), 37\u201344 (1981)","journal-title":"SIGSAM Bull."},{"key":"13_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/978-3-540-89255-7_24","volume-title":"Advances in Cryptology - ASIACRYPT 2008","author":"X. Pujol","year":"2008","unstructured":"Pujol, X., Stehl\u00e9, D.: Rigorous and efficient short lattice vectors enumeration. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol.\u00a05350, pp. 390\u2013405. Springer, Heidelberg (2008)"},{"key":"13_CR29","unstructured":"Pujol, X., Stehl\u00e9, D.: Solving the shortest lattice vector problem in time 22.465n, IACR eprint report number 2009\/605 (2009)"},{"key":"13_CR30","unstructured":"Schnorr, C.-P.: Average time fast SVP and CVP algorithms for low density lattices. TR Goethe Universit\u00e4t Frankfurt (January 4, 2010)"},{"issue":"2-3","key":"13_CR31","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0304-3975(87)90064-8","volume":"53","author":"C.-P. Schnorr","year":"1987","unstructured":"Schnorr, C.-P.: A hierarchy of polynomial lattice basis reduction algorithms. Theoretical Computer Science\u00a053(2-3), 201\u2013224 (1987)","journal-title":"Theoretical Computer Science"},{"key":"13_CR32","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01581144","volume":"66","author":"C.-P. Schnorr","year":"1994","unstructured":"Schnorr, C.-P., Euchner, M.: Lattice basis reduction: improved practical algorithms and solving subset sum problems. Math. Programming\u00a066, 181\u2013199 (1994)","journal-title":"Math. Programming"},{"key":"13_CR33","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Advances in Cryptology - EUROCRYPT \u201995","author":"C.-P. Schnorr","year":"1995","unstructured":"Schnorr, C.-P., H\u00f6rner, H.H.: Attacking the Chor-Rivest cryptosystem by improved lattice reduction. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol.\u00a0921, pp. 1\u201312. Springer, Heidelberg (1995)"},{"key":"13_CR34","unstructured":"Shoup, V.: Number Theory C++ Library (NTL) version 5.4.1, http:\/\/www.shoup.net\/ntl\/"},{"key":"13_CR35","doi-asserted-by":"crossref","unstructured":"Stehl\u00e9, D., Watkins, M.: On the extremality of an 80-dimensional lattice (2010) (manuscript)","DOI":"10.1007\/978-3-642-14518-6_27"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13190-5_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:02:24Z","timestamp":1606186944000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13190-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131899","9783642131905"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13190-5_13","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-642-13190-5","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}