{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:14:16Z","timestamp":1725794056548},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662434130"},{"type":"electronic","value":"9783662434147"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43414-7_2","type":"book-chapter","created":{"date-parts":[[2014,5,20]],"date-time":"2014-05-20T14:57:06Z","timestamp":1400597826000},"page":"29-47","source":"Crossref","is-referenced-by-count":18,"title":["A Three-Level Sieve Algorithm for the Shortest Vector Problem"],"prefix":"10.1007","author":[{"given":"Feng","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Yanbin","family":"Pan","sequence":"additional","affiliation":[]},{"given":"Gengran","family":"Hu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,5,21]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Adleman, L.M.: On breaking generalized knapsack public key cryptosystems. In: The 15th Annual ACM Symposium on Theory of Computing Proceedings, pp. 402\u2013412. ACM, April 1983","DOI":"10.1145\/800061.808771"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: The shortest vector problem in \n                      \n                        \n                      \n                      $$l_2$$\n                     is NP-hard for randomized reductions. In: Proceedings of the 30th STOC. ACM (1998)","DOI":"10.1145\/276698.276705"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Kumar, R., Sivakumar, D.: A sieve algorithm for the shortest lattice vector problem. In: Proceedings of the 33rd STOC, pp. 601\u2013610. ACM (2001)","DOI":"10.1145\/380752.380857"},{"issue":"18","key":"2_CR4","doi-asserted-by":"publisher","first-page":"1648","DOI":"10.1016\/j.tcs.2008.12.045","volume":"410","author":"J Bl\u00f6mer","year":"2009","unstructured":"Bl\u00f6mer, J., Naewe, S.: Sampling methods for shortest vectors, closest vectors and successive minima. Theor. Comput. Sci. 410(18), 1648\u20131665 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR5","series-title":"LNCS","first-page":"194","volume-title":"EUROCAL","author":"U Fincke","year":"1983","unstructured":"Fincke, U., Pohst, M.: A procedure for determining algebraic integers of given norm. In: van Hulzen, J.A. (ed.) EUROCAL. LNCS, vol. 162, pp. 194\u2013202. Springer, Heidelberg (1983)"},{"issue":"170","key":"2_CR6","doi-asserted-by":"publisher","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. Comp. 44(170), 463\u2013471 (1985)","journal-title":"Math. Comp."},{"key":"2_CR7","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/11818175_7","volume-title":"CRYPTO 2006","author":"N Gama","year":"2006","unstructured":"Gama, N., Howgrave-Graham, N., Koy, H., Nguy\u00ean, P.Q.: Rankin\u2019s constant and blockwise lattice reduction. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 112\u2013130. Springer, Heidelberg (2006)"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Gama, N., Nguyen, P.Q.: Finding short lattice vectors within Mordell\u2019s inequality. In: STOC \u201908-Proceedings of the 40th ACM Symposium on the Theory of Computing. ACM (2008)","DOI":"10.1145\/1374376.1374408"},{"key":"2_CR9","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-642-13190-5_13","volume-title":"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":"2_CR10","series-title":"LNCS","first-page":"267","volume-title":"ANTS 1998","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. 1423, pp. 267\u2013288. Springer, Heidelberg (1998)"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Kannan, R.: Improved algorithms for integer programming and related lattice problems. In: Proceedings of the 15th STOC, pp. 193\u2013206. ACM (1983)","DOI":"10.1145\/800061.808749"},{"key":"2_CR12","unstructured":"Klein, P.N.: Finding the closest lattice vector when it\u2019s unusually close. In: Proceedings of the SODA, pp. 937\u2013941. ACM (2000)"},{"key":"2_CR13","doi-asserted-by":"publisher","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."},{"issue":"1","key":"2_CR14","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1145\/2455.2461","volume":"32","author":"JC Lagarias","year":"1985","unstructured":"Lagarias, J.C., Odlyzko, A.M.: Solving low-density subset sum problems. J. ACM 32(1), 229\u2013246 (1985)","journal-title":"J. ACM"},{"key":"2_CR15","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 STOC, pp. 351\u2013358. ACM (2010)","DOI":"10.1145\/1806689.1806739"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Voulgaris, P.; Faster exponential time algorithms for the shortest vector problem. In: The 21st Annual ACM-SIAM Symposium on Discrete Algorithms Proceedings, pp. 1468\u20131480. SIAM, January 2010","DOI":"10.1137\/1.9781611973075.119"},{"key":"2_CR17","series-title":"LNCS","first-page":"452","volume-title":"PaCT 2011","author":"B Milde","year":"2011","unstructured":"Milde, B., Schneider, M.: A parallel implementation of GaussSieve for the shortest vector problem in lattices. In: Malyshkin, V. (ed.) PaCT 2011. LNCS, vol. 6873, pp. 452\u2013458. Springer, Heidelberg (2011)"},{"key":"2_CR18","series-title":"LNCS","first-page":"238","volume-title":"ANTS 2006","author":"PQ Nguy\u00ean","year":"2006","unstructured":"Nguy\u00ean, 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)"},{"key":"2_CR19","series-title":"LNCS","first-page":"146","volume-title":"CaLC 2001","author":"PQ Nguy\u00ean","year":"2001","unstructured":"Nguy\u00ean, P.Q., Stern, J.: The two faces of lattices in cryptology. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol. 2146, pp. 146\u2013180. Springer, Heidelberg (2001)"},{"issue":"2","key":"2_CR20","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1515\/JMC.2008.009","volume":"2","author":"PQ Nguyen","year":"2008","unstructured":"Nguyen, P.Q., Vidick, T.: Sieve algorithms for the shortest vector problem are practical. J. Math. Cryptology 2(2), 181\u2013207 (2008)","journal-title":"J. Math. Cryptology"},{"key":"2_CR21","unstructured":"Pujol, X., Stehl\u00e9, D.: Solving the shortest lattice vector problem in time \n                      \n                        \n                      \n                      $$2^{2.465n}$$\n                    . Cryptology ePrint Archive, Report 2009\/605 (2009)"},{"key":"2_CR22","unstructured":"Regev, O.: Lecture notes on lattices in computer science. \n                      http:\/\/www.cs.tau.ac.il\/odedr\/teaching\/latticesfall2004\/index.html\n                      \n                     (2004)"},{"key":"2_CR23","series-title":"LNCS","first-page":"89","volume-title":"WALCOM 2011","author":"M Schneider","year":"2011","unstructured":"Schneider, M.: Analysis of Gauss-sieve for solving the shortest vector problem in lattices. In: Katoh, N., Kumar, A. (eds.) WALCOM 2011. LNCS, vol. 6552, pp. 89\u201397. Springer, Heidelberg (2011)"},{"key":"2_CR24","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-642-38553-7_22","volume-title":"AFRICACRYPT 2013","author":"M Schneider","year":"2013","unstructured":"Schneider, M.: Sieving for shortest vectors in ideal lattices. In: Youssef, A., Nitaj, A., Hassanien, A.E. (eds.) AFRICACRYPT 2013. LNCS, vol. 7918, pp. 375\u2013391. Springer, Heidelberg (2013)"},{"key":"2_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. Theoret. Comput. Sci. 53, 201\u2013224 (1987)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR26","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01581144","volume":"66","author":"CP 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":"2_CR27","doi-asserted-by":"crossref","unstructured":"Shamir, A.: A polynomial time algorithm for breading the basic Merkel-Hellman cryptosystem. In: The 23rd IEEE Symposium on Foundations of Computer Science Proceedings, pp. 145\u2013152. IEEE (1982)","DOI":"10.1109\/SFCS.1982.5"},{"key":"2_CR28","unstructured":"Shoup, V.: NTL: a library for doing number theory. \n                      http:\/\/www.shoup.net\/ntl\/"},{"key":"2_CR29","unstructured":"Voulgaris, P.: Gauss Sieve alpha V. 0.1 (2010). \n                      http:\/\/cseweb.ucsd.edu\/pvoulgar\/impl.html"},{"key":"2_CR30","doi-asserted-by":"crossref","unstructured":"Wang, X., Liu, M., Tian, C., Bi, J.: Improved Nguyen-Vidick Heuristic sieve algorithm for shortest vector problem. In: The 6th ACM Symposium on Information, Computer and Communications Security Proceedings, pp. 1\u20139. ACM (2011)","DOI":"10.1145\/1966913.1966915"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography -- SAC 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43414-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T21:31:38Z","timestamp":1558906298000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43414-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662434130","9783662434147"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43414-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}