{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T15:08:43Z","timestamp":1790694523756,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662543641","type":"print"},{"value":"9783662543658","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-662-54365-8_2","type":"book-chapter","created":{"date-parts":[[2017,2,25]],"date-time":"2017-02-25T04:12:23Z","timestamp":1487995943000},"page":"16-40","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":41,"title":["Improved Algorithms for the Approximate k-List Problem in Euclidean Norm"],"prefix":"10.1007","author":[{"given":"Gottfried","family":"Herold","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Elena","family":"Kirshanova","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,2,26]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Kumar, R., Sivakumar, D.: A sieve algorithm for the shortest lattice vector problem. In: Proceedings of STOC, pp. 601\u2013610 (2001)","DOI":"10.1145\/380752.380857"},{"issue":"4","key":"2_CR2","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1016\/S0378-4754(96)00035-3","volume":"42","author":"AG Akritas","year":"1996","unstructured":"Akritas, A.G., Akritas, E.K., Malaschonok, G.I.: Symbolic computation, new trends and developments various proofs of Sylvester\u2019s (determinant) identity. Math. Comput. Simul. 42(4), 585\u2013593 (1996)","journal-title":"Math. Comput. Simul."},{"key":"2_CR3","unstructured":"Bai, S.: Personal Communication, August 2016"},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1112\/S1461157016000292","volume":"19A","author":"S Bai","year":"2016","unstructured":"Bai, S., Laarhoven, T., Stehl\u00e9, D.: Tuple lattice sieving. LMS J. Comput. Math. 19A, 146\u2013162 (2016). doi:\n                      10.1112\/S1461157016000292\n                      \n                    . Algorithmic Number Theory Symposium (ANTS) XII","journal-title":"LMS J. Comput. Math."},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Becker, A., Ducas, L., Gama, N., Laarhoven, T.: New directions in nearest neighbor searching with applications to lattice sieving. In: Krauthgamer, R. (eds.) Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, pp. 10\u201324. SIAM, 10\u201312 January 2016","DOI":"10.1137\/1.9781611974331.ch2"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1145\/792538.792543","volume":"50","author":"A Blum","year":"2003","unstructured":"Blum, A., Kalai, A., Wasserman, H.: Noise-tolerant learning, the parity problem, and the statistical query model. J. ACM 50, 506\u2013519 (2003)","journal-title":"J. ACM"},{"key":"2_CR7","unstructured":"SVP Challenge: SVP challenge generator. \n                      http:\/\/latticechallenge.org\/svp-challenge"},{"issue":"2","key":"2_CR8","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1198\/000313002317572754","volume":"56","author":"M Ghosh","year":"2002","unstructured":"Ghosh, M., Sinha, B.K.: A simple derivation of the Wishart distribution. Am. Stat. 56(2), 100\u2013101 (2002)","journal-title":"Am. Stat."},{"issue":"3","key":"2_CR9","first-page":"165","volume":"15","author":"D Goldstein","year":"2006","unstructured":"Goldstein, D., Mayer, A.: On the equidistribution of Hecke points. Forum Mathematicum 15(3), 165\u2013189 (2006)","journal-title":"Forum Mathematicum"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Kannan, R.: Improved algorithms for integer programming and related lattice problems. In: Proceedings of STOC, pp. 193\u2013206 (1983)","DOI":"10.1145\/800061.808749"},{"key":"2_CR11","unstructured":"Klein, P.: Finding the closest lattice vector when it\u2019s unusually close. In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2000, pp. 937\u2013941 (2000)"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/11916277_21","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"O Kupferman","year":"2006","unstructured":"Kupferman, O., Lustig, Y., Vardi, M.Y.: On locally checkable properties. In: Hermann, M., Voronkov, A. (eds.) LPAR 2006. LNCS (LNAI), vol. 4246, pp. 302\u2013316. Springer, Heidelberg (2006). doi:\n                      10.1007\/11916277_21"},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-662-47989-6_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"T Laarhoven","year":"2015","unstructured":"Laarhoven, T.: Sieving for shortest vectors in lattices using angular locality-sensitive hashing. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9215, pp. 3\u201322. Springer, Heidelberg (2015)"},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/11538462_32","volume-title":"Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques","author":"V Lyubashevsky","year":"2005","unstructured":"Lyubashevsky, V.: The parity problem in the presence of noise, decoding random linear codes, and the subset sum problem. In: Chekuri, C., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) APPROX\/RANDOM -2005. LNCS, vol. 3624, pp. 378\u2013389. Springer, Heidelberg (2005). doi:\n                      10.1007\/11538462_32"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Mariano, A., Laarhoven, T., Bischof, C.: Parallel (probable) lock-free hash sieve: a practical sieving algorithm for the SVP. In: 44th International Conference on Parallel Processing (ICPP), pp. 590\u2013599, September 2015","DOI":"10.1109\/ICPP.2015.68"},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-662-46800-5_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"A May","year":"2015","unstructured":"May, A., Ozerov, I.: On computing nearest neighbors with applications to decoding of binary linear codes. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 203\u2013228. Springer, Heidelberg (2015). doi:\n                      10.1007\/978-3-662-46800-5_9"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Voulgaris, P.: Faster exponential time algorithms for the shortest vector problem. In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, pp. 1468\u20131480 (2010)","DOI":"10.1137\/1.9781611973075.119"},{"key":"2_CR18","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, 181\u2013207 (2008)","journal-title":"J. Math. Crypt."},{"key":"2_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/3-540-45708-9_19","volume-title":"Advances in Cryptology \u2014 CRYPTO 2002","author":"D Wagner","year":"2002","unstructured":"Wagner, D.: A generalized birthday problem. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 288\u2013304. Springer, Heidelberg (2002). doi:\n                      10.1007\/3-540-45708-9_19"},{"issue":"1\u20132","key":"2_CR20","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1093\/biomet\/20A.1-2.32","volume":"20A","author":"J Wishart","year":"1928","unstructured":"Wishart, J.: The generalized product moment distribution in samples from a normal multivariate population. Biometrika 20A(1\u20132), 32\u201352 (1928)","journal-title":"Biometrika"}],"container-title":["Lecture Notes in Computer Science","Public-Key Cryptography \u2013 PKC 2017"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-54365-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,23]],"date-time":"2020-02-23T20:09:10Z","timestamp":1582488550000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-54365-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783662543641","9783662543658"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-54365-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"26 February 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PKC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IACR International Workshop on Public Key Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Amsterdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 March 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 March 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pkc2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iacr.org\/workshops\/pkc2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}