{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:58:35Z","timestamp":1764997115348},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319566139"},{"type":"electronic","value":"9783319566146"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-56614-6_3","type":"book-chapter","created":{"date-parts":[[2017,3,30]],"date-time":"2017-03-30T22:31:20Z","timestamp":1490913080000},"page":"65-102","source":"Crossref","is-referenced-by-count":33,"title":["Random Sampling Revisited: Lattice Enumeration with Discrete Pruning"],"prefix":"10.1007","author":[{"given":"Yoshinori","family":"Aono","sequence":"first","affiliation":[]},{"given":"Phong Q.","family":"Nguyen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,4,1]]},"reference":[{"issue":"8","key":"3_CR1","doi-asserted-by":"crossref","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. Info. Theory 48(8), 2201\u20132214 (2002)","journal-title":"IEEE Trans. Info. Theory"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1007\/978-3-662-49890-3_30","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"Y Aono","year":"2016","unstructured":"Aono, Y., Wang, Y., Hayashi, T., Takagi, T.: Improved progressive BKZ algorithms and their precise cost estimation by sharp simulator. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9665, pp. 789\u2013819. Springer, Heidelberg (2016). doi: 10.1007\/978-3-662-49890-3_30"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BFb0023990","volume-title":"STACS 85","author":"L Babai","year":"1985","unstructured":"Babai, L.: On Lov\u00e1sz\u2019 lattice reduction and the nearest lattice point problem. In: Mehlhorn, K. (ed.) STACS 1985. LNCS, vol. 182, pp. 13\u201320. Springer, Heidelberg (1985). doi: 10.1007\/BFb0023990"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/11792086_17","volume-title":"Algorithmic Number Theory","author":"J Buchmann","year":"2006","unstructured":"Buchmann, J., Ludwig, C.: Practical lattice basis sampling reduction. In: Hess, F., Pauli, S., Pohst, M. (eds.) ANTS 2006. LNCS, vol. 4076, pp. 222\u2013237. Springer, Heidelberg (2006). doi: 10.1007\/11792086_17"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-25385-0_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"Y Chen","year":"2011","unstructured":"Chen, Y., Nguyen, P.Q.: BKZ 2.0: better lattice security estimates. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 1\u201320. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-25385-0_1"},{"doi-asserted-by":"crossref","unstructured":"Ding, D., Zhu, G., Wang, X.: A genetic algorithm for searching the shortest lattice vector of SVP challenge. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2015, pp. 823\u2013830 (2015)","key":"3_CR6","DOI":"10.1145\/2739480.2754639"},{"issue":"170","key":"3_CR7","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1090\/S0025-5718-1985-0777278-8","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. Math. Comput. 44(170), 463\u2013471 (1985)","journal-title":"Math. Comput."},{"issue":"1","key":"3_CR8","first-page":"67","volume":"23","author":"M Fukase","year":"2015","unstructured":"Fukase, M., Kashiwabara, K.: An accelerated algorithm for solving SVP based on statistical analysis. JIP 23(1), 67\u201380 (2015)","journal-title":"JIP"},{"issue":"6","key":"3_CR9","first-page":"42","volume":"9","author":"M Fukase","year":"2011","unstructured":"Fukase, M., Yamaguchi, K.: Analysis of the extended search space for the shortest vector in lattice. J. Syst. Cybern. Inf. 9(6), 42\u201346 (2011)","journal-title":"J. Syst. Cybern. Inf."},{"key":"3_CR10","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. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 31\u201351. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-78967-3_3"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-642-13190-5_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"N Gama","year":"2010","unstructured":"Gama, N., Nguyen, P.Q., Regev, O.: Lattice enumeration using extreme pruning. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 257\u2013278. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-13190-5_13"},{"key":"3_CR12","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. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 170\u2013186. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-74143-5_10"},{"issue":"5","key":"3_CR13","doi-asserted-by":"crossref","first-page":"859","DOI":"10.1137\/0218059","volume":"18","author":"J H\u00e5stad","year":"1989","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. 18(5), 859\u2013881 (1989)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"3_CR14","doi-asserted-by":"crossref","first-page":"1015","DOI":"10.1029\/RS016i006p01015","volume":"16","author":"T Hosono","year":"1981","unstructured":"Hosono, T.: Numerical inversion of laplace transform and some applications to wave optics. Radio Sci. 16(6), 1015\u20131019 (1981)","journal-title":"Radio Sci."},{"doi-asserted-by":"crossref","unstructured":"Kannan, R.: Improved algorithms for integer programming and related lattice problems. In: Proceedings of the 15th ACM Symposium on Theory of Computing (STOC), pp. 193\u2013206 (1983)","key":"3_CR15","DOI":"10.1145\/800061.808749"},{"key":"3_CR16","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1007\/BF01457454","volume":"261","author":"AK Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra Jr., H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Math. Ann. 261, 513\u2013534 (1982)","journal-title":"Math. Ann."},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-642-19074-2_21","volume-title":"Topics in Cryptology \u2013 CT-RSA 2011","author":"R Lindner","year":"2011","unstructured":"Lindner, R., Peikert, C.: Better key sizes (and Attacks) for LWE-based encryption. In: Kiayias, A. (ed.) CT-RSA 2011. LNCS, vol. 6558, pp. 319\u2013339. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-19074-2_21"},{"unstructured":"Lindner, R., R\u00fcckert, M.: TU Darmstadt lattice challenge. http:\/\/www.latticechallenge.org\/","key":"3_CR18"},{"key":"3_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-642-36095-4_19","volume-title":"Topics in Cryptology \u2013 CT-RSA 2013","author":"M Liu","year":"2013","unstructured":"Liu, M., Nguyen, P.Q.: Solving BDD by enumeration: an update. In: Dawson, E. (ed.) CT-RSA 2013. LNCS, vol. 7779, pp. 293\u2013309. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-36095-4_19"},{"unstructured":"Ludwig, C.: Practical Lattice Basis Sampling Reduction. Ph.D. thesis, Technische Universit\u00e4t Darmstadt (2005)","key":"3_CR20"},{"key":"3_CR21","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/BF01571276","volume":"17","author":"JE Mazo","year":"1990","unstructured":"Mazo, J.E., Odlyzko, A.M.: Lattice points in high dimensional spheres. Monatsh. Math. 17, 47\u201361 (1990)","journal-title":"Monatsh. Math."},{"doi-asserted-by":"crossref","unstructured":"Nguyen, P.Q.: Public-key cryptanalysis. In: Luengo, I. (ed.) Recent Trends in Cryptography. Contemporary Mathematics, vol. 477. AMS-RSME (2009)","key":"3_CR22","DOI":"10.1090\/conm\/477\/09304"},{"key":"3_CR23","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":"PQ 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. 4076, pp. 238\u2013256. Springer, Heidelberg (2006). doi: 10.1007\/11792086_18"},{"key":"3_CR24","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":"1","key":"3_CR25","doi-asserted-by":"crossref","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. 15(1), 37\u201344 (1981)","journal-title":"SIGSAM Bull."},{"issue":"3","key":"3_CR26","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1112\/plms\/s3-6.2.305","volume":"6","author":"CA Rogers","year":"1956","unstructured":"Rogers, C.A.: The number of lattice points in a set. Proc. London Math. Soc. 6(3), 305\u2013320 (1956)","journal-title":"Proc. London Math. Soc."},{"issue":"4","key":"3_CR27","doi-asserted-by":"crossref","first-page":"779","DOI":"10.1137\/SIREAD000039000004000761000001","volume":"39","author":"CC Rousseau","year":"1997","unstructured":"Rousseau, C.C., Ruehr, O.G.: Problems and solutions. SIAM Review 39(4), 779\u2013786 (1997). Subsection: The Volume of the Intersection of a Cube and a Ball in $$N$$ -space. Two solutions by Bernd Tibken and Denis Constales","journal-title":"SIAM Review"},{"unstructured":"Schneider, M., Gama, N.: SVP challenge. http:\/\/www.latticechallenge.org\/svp-challenge\/","key":"3_CR28"},{"key":"3_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-642-23951-9_11","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2011","author":"M Schneider","year":"2011","unstructured":"Schneider, M., G\u00f6ttert, N.: Random sampling for short lattice vectors on graphics cards. In: Preneel, B., Takagi, T. (eds.) CHES 2011. LNCS, vol. 6917, pp. 160\u2013175. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-23951-9_11"},{"key":"3_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/3-540-36494-3_14","volume-title":"STACS 2003","author":"CP Schnorr","year":"2003","unstructured":"Schnorr, C.P.: Lattice reduction by random sampling and birthday methods. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol. 2607, pp. 145\u2013156. Springer, Heidelberg (2003). doi: 10.1007\/3-540-36494-3_14"},{"key":"3_CR31","doi-asserted-by":"crossref","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. Program. 66, 181\u2013199 (1994)","journal-title":"Math. Program."},{"key":"3_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-49264-X_1","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201995","author":"CP 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. 921, pp. 1\u201312. Springer, Heidelberg (1995). doi: 10.1007\/3-540-49264-X_1"},{"unstructured":"Innovation, S.: NTRU challenge. https:\/\/www.securityinnovation.com\/products\/ntru-crypto\/ntru-challenge","key":"3_CR33"},{"issue":"2","key":"3_CR34","doi-asserted-by":"crossref","first-page":"340","DOI":"10.2307\/1969027","volume":"46","author":"CL Siegel","year":"1945","unstructured":"Siegel, C.L.: A mean value theorem in geometry of numbers. Ann. Math. 46(2), 340\u2013347 (1945)","journal-title":"Ann. Math."},{"key":"3_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/978-3-642-14518-6_27","volume-title":"Algorithmic Number Theory","author":"D Stehl\u00e9","year":"2010","unstructured":"Stehl\u00e9, D., Watkins, M.: On the extremality of an 80-dimensional lattice. In: Hanrot, G., Morain, F., Thom\u00e9, E. (eds.) ANTS 2010. LNCS, vol. 6197, pp. 340\u2013356. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-14518-6_27"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2017"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-56614-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T09:54:02Z","timestamp":1498384442000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-56614-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319566139","9783319566146"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-56614-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}