{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:40:17Z","timestamp":1742942417366,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319159423"},{"type":"electronic","value":"9783319159430"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-15943-0_7","type":"book-chapter","created":{"date-parts":[[2015,3,16]],"date-time":"2015-03-16T10:27:17Z","timestamp":1426501637000},"page":"101-113","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Fast Phase-based Enumeration Algorithm for\u00a0SVP Challenge Through $$y$$-Sparse Representations of Short Lattice Vectors"],"prefix":"10.1007","author":[{"given":"Dan","family":"Ding","sequence":"first","affiliation":[]},{"given":"Guizhen","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Yang","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Zhongxiang","family":"Zheng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,3,17]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: STOC, pp. 99\u2013108 (1996)","DOI":"10.1145\/237814.237838"},{"key":"7_CR2","unstructured":"Ajtai, M.: The shortest vector problem in $$\\ell _2$$ is np-hard for randomized reductions. In: Proceeding of the 30th Symposium on the Theory of Computing (STOC 1998), pp. 284\u2013406 (1998)"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Dwork, C.: A public-key cryptosystem with worst-case\/average-case equivalence. In: STOC, pp. 284\u2013293 (1997)","DOI":"10.1145\/258533.258604"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Kumar, R., Sivaumar, D.: A sieve algorithm for the shortest lattice vector problem. In: Proceedings of the 33th Annual ACM Symposium on Theory of Computing (STOC 2001), vol. 33, pp. 601\u2013610 (2001)","DOI":"10.1145\/380752.380857"},{"key":"7_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)"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Ding, D., Zhu, G., Wang, X.: A genetic algorithm for searching shortest lattice vector of svp challenge. Cryptology ePrint Archive, Report 2014\/489 (2014). http:\/\/eprint.iacr.org\/","DOI":"10.1145\/2739480.2754639"},{"key":"7_CR7","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)"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/BFb0052231","volume-title":"Advances in Cryptology - CRYPTO 1997","author":"O Goldreich","year":"1997","unstructured":"Goldreich, O., Goldwasser, S., Halevi, S.: Public-key cryptosystems from lattice reduction problems. In: Kaliski Jr, B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 112\u2013131. Springer, Heidelberg (1997)"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/978-3-642-22792-9_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"G Hanrot","year":"2011","unstructured":"Hanrot, G., Pujol, X., Stehl\u00e9, D.: Analyzing blockwise lattice algorithms using dynamical systems. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 447\u2013464. Springer, Heidelberg (2011)"},{"key":"7_CR10","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)"},{"key":"7_CR11","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)"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0304-3975(85)90067-2","volume":"41","author":"B Helfrich","year":"1985","unstructured":"Helfrich, B.: Algorithms to construct minkowski reduced and hermit reduced bases. Theor. Comput. Sci. 41, 125\u2013139 (1985)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR13","unstructured":"Kannan, R.: Improved algorithms for integer programming and related lattice problems. In: Proceedings of the 15th Symposium on the Theory of Computing (STOC1983), vol. 15, pp. 99\u2013108 (1983)"},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1287\/moor.12.3.415","volume":"12","author":"R Kannan","year":"1987","unstructured":"Kannan, R.: Minkowski\u2019s convex body theorem and integer programming. Math. Oper. Res. 12, 415\u2013440 (1987)","journal-title":"Math. Oper. Res."},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/BF01457454","volume":"261","author":"AK Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra, H.W., Lav\u00e1sz, L.: Factoring polynomials with rational coefficients. Math. Ann. 261, 513\u2013534 (1982)","journal-title":"Math. Ann."},{"key":"7_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0897-7","volume-title":"Complexity of Lattice Problems: A Cryptographic Perspective","author":"D Micciancio","year":"2002","unstructured":"Micciancio, D., Goldwasser, S.: Complexity of Lattice Problems: A Cryptographic Perspective. Kluwer Academic Publishers, Boston (2002)"},{"key":"7_CR17","unstructured":"Micciancio, D., Regev, O.: Worst-case to average-case reductions based on Gaussian measure. In: Proceedings of the 45th Annual Symposium on Foundations of Computer Science - FOCS 2004, pp. 371\u2013381. IEEE, Rome, October 2004. (Journal verion in SIAM Journal on Computing)"},{"issue":"1","key":"7_CR18","doi-asserted-by":"publisher","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 measure. SIAM J. Comput. 37(1), 267\u2013302 (2007). Preliminary version in FOCS 2004","journal-title":"SIAM J. Comput."},{"key":"7_CR19","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-540-88702-7_5","volume-title":"Proceeding of the Post-Quantum Cryptography (PQC 2009)","author":"D Micciancio","year":"2009","unstructured":"Micciancio, D., Regev, O.: Lattice-based cryptography. In: Bernstein, D.J., Buchmann, J., Dahmen, E. (eds.) Proceeding of the Post-Quantum Cryptography (PQC 2009), pp. 147\u2013191. Springer, Heidelberg (2009)"},{"key":"7_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: Proceedings of the 42th Annual ACM Symposium on Theory of Computing (STOC 2010), vol. 42, pp. 351\u2013358 (2010)","DOI":"10.1145\/1806689.1806739"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Walter, M.: Fast lattice point enumeration with minimal overhead. Cryptology ePrint Archive, Report 2014\/569 (2014). http:\/\/eprint.iacr.org\/","DOI":"10.1137\/1.9781611973730.21"},{"issue":"2","key":"7_CR22","first-page":"181","volume":"2","author":"PQ Nguyen","year":"2008","unstructured":"Nguyen, P.Q., Vidick, T.: Sieve algorithms for the shortest vector problem are practical. J. Math. Crypt. 2(2), 181\u2013207 (2008)","journal-title":"J. Math. Crypt."},{"issue":"6","key":"7_CR23","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1145\/1039488.1039490","volume":"51","author":"O Regev","year":"2004","unstructured":"Regev, O.: New lattice-based cryptographic constructions. J. ACM 51(6), 899\u2013942 (2004)","journal-title":"J. ACM"},{"key":"7_CR24","unstructured":"Schneider, M., Gamma, N.: SVP challenge (2010). http:\/\/www.latticechallenge.org\/svp-challenge\/"},{"key":"7_CR25","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0304-3975(87)90064-8","volume":"53","author":"CP Schnorr","year":"1987","unstructured":"Schnorr, C.P.: A hierarchy of polynomial lattice basis reduction algorithms. Theor. Comput. Sci. 53, 201\u2013224 (1987)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR26","unstructured":"Shoup, V.: Number theory C++ library (NTL) vesion 6.0.0 (2010). http:\/\/www.shoup.net\/ntl\/"},{"key":"7_CR27","unstructured":"van Emde Boas, P.: Another np-complete partition problem and the complexity of computing short vectors in a lattice, pp. 81\u201304. Technical report, Mathematisch Instituut, Universiteit van Amsterdam (1981)"},{"key":"7_CR28","doi-asserted-by":"crossref","unstructured":"Wang, X., Liu, M., Tian, C., Bi, J.: Improved Nguyen-Vidick heuristic sieve algorithm for shortest vector problem. In: Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security, pp. 1\u20139. ACM (2011)","DOI":"10.1145\/1966913.1966915"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology - ICISC 2014"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-15943-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T09:39:16Z","timestamp":1675849156000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-15943-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319159423","9783319159430"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-15943-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"17 March 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}