{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:08:45Z","timestamp":1742965725381,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030519377"},{"type":"electronic","value":"9783030519384"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-51938-4_15","type":"book-chapter","created":{"date-parts":[[2020,7,4]],"date-time":"2020-07-04T11:02:54Z","timestamp":1593860574000},"page":"301-320","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Sieve, Enumerate, Slice, and Lift:"],"prefix":"10.1007","author":[{"given":"Emmanouil","family":"Doulgerakis","sequence":"first","affiliation":[]},{"given":"Thijs","family":"Laarhoven","sequence":"additional","affiliation":[]},{"given":"Benne","family":"de Weger","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,7,5]]},"reference":[{"key":"15_CR1","unstructured":"SVP Challenge (2019). \nhttps:\/\/www.latticechallenge.org\/svp-challenge\/"},{"key":"15_CR2","doi-asserted-by":"publisher","unstructured":"Aggarwal, D., Dadush, D., Regev, O., Stephens-Davidowitz, N.: Solving the shortest vector problem in $$2^n$$ time via discrete Gaussian sampling. In: Proceedings of the 47th STOC, pp. 733\u2013742 (2015). \nhttps:\/\/doi.org\/10.1145\/2746539.2746606","DOI":"10.1145\/2746539.2746606"},{"key":"15_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 Press (2001)","DOI":"10.1145\/380752.380857"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/978-3-030-17656-3_25","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"MR Albrecht","year":"2019","unstructured":"Albrecht, M.R., Ducas, L., Herold, G., Kirshanova, E., Postlethwaite, E.W., Stevens, M.: The general sieve kernel and new records in lattice reduction. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11477, pp. 717\u2013746. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-17656-3_25"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-319-56614-6_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"Y Aono","year":"2017","unstructured":"Aono, Y., Nguyen, P.Q.: Random sampling revisited: lattice enumeration with discrete pruning. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10211, pp. 65\u2013102. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-56614-6_3"},{"issue":"1","key":"15_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02579403","volume":"6","author":"L Babai","year":"1986","unstructured":"Babai, L.: On lovasz lattice reduction and the nearest lattice point problem. Combinatorica 6(1), 1\u201313 (1986). \nhttps:\/\/doi.org\/10.1007\/BF02579403","journal-title":"Combinatorica"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Bai, S., Laarhoven, T., Stehl\u00e9, D.: Tuple lattice sieving. In: Proceedings of the 12th ANTS 19(A), pp. 146\u2013162 (2016)","DOI":"10.1112\/S1461157016000292"},{"key":"15_CR8","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: Proceedings of the 27th SODA, pp. 10\u201324. ACM-SIAM (2016)","DOI":"10.1137\/1.9781611974331.ch2"},{"key":"15_CR9","doi-asserted-by":"publisher","unstructured":"Chen, Y., Nguy\u00ean, P.Q.: BKZ 2.0: Better lattice security estimates. In: Proceedings of the 17th ASIACRYPT, pp. 1\u201320 (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-25385-0_1","DOI":"10.1007\/978-3-642-25385-0_1"},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-25510-7_1","volume-title":"Post-Quantum Cryptography","author":"E Doulgerakis","year":"2019","unstructured":"Doulgerakis, E., Laarhoven, T., de Weger, B.: Finding closest lattice vectors using approximate Voronoi cells. In: Ding, J., Steinwandt, R. (eds.) PQCrypto 2019. LNCS, vol. 11505, pp. 3\u201322. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-25510-7_1"},{"key":"15_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-319-78381-9_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"L Ducas","year":"2018","unstructured":"Ducas, L.: Shortest vector from lattice sieving: a few dimensions for free. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10820, pp. 125\u2013145. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-78381-9_5"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Ducas, L., Laarhoven, T., van Woerden, W.: The randomized slicer for CVPP: sharper, faster, smaller, batchier. Preprint (2019)","DOI":"10.1007\/978-3-030-45388-6_1"},{"issue":"170","key":"15_CR13","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. Math. Comput. 44(170), 463\u2013471 (1985)","journal-title":"Math. Comput."},{"issue":"1","key":"15_CR14","doi-asserted-by":"publisher","first-page":"67","DOI":"10.2197\/ipsjjip.23.67","volume":"23","author":"M Fukase","year":"2015","unstructured":"Fukase, M., Kashiwabara, K.: An accelerated algorithm for solving SVP based on statistical analysis. J. Inf. Process. 23(1), 67\u201380 (2015). \nhttps:\/\/doi.org\/10.2197\/ipsjjip.23.67","journal-title":"J. Inf. Process."},{"key":"15_CR15","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). \nhttps:\/\/doi.org\/10.1007\/978-3-642-13190-5_13"},{"key":"15_CR16","doi-asserted-by":"publisher","unstructured":"Hanrot, G., Pujol, X., Stehl\u00e9, D.: Algorithms for the shortest and closest lattice vector problems. In: Proceedings of the 3rd IWCC, pp. 159\u2013190 (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-20901-7_10","DOI":"10.1007\/978-3-642-20901-7_10"},{"key":"15_CR17","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). \nhttps:\/\/doi.org\/10.1007\/978-3-540-74143-5_10"},{"key":"15_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-662-54365-8_2","volume-title":"Public-Key Cryptography \u2013 PKC 2017","author":"G Herold","year":"2017","unstructured":"Herold, G., Kirshanova, E.: Improved algorithms for the approximate k-list problem in euclidean norm. In: Fehr, S. (ed.) PKC 2017. LNCS, vol. 10174, pp. 16\u201340. Springer, Heidelberg (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-662-54365-8_2"},{"key":"15_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-3-319-76578-5_14","volume-title":"Public-Key Cryptography \u2013 PKC 2018","author":"G Herold","year":"2018","unstructured":"Herold, G., Kirshanova, E., Laarhoven, T.: Speed-ups and time\u2013memory trade-offs for tuple lattice sieving. In: Abdalla, M., Dahab, R. (eds.) PKC 2018. LNCS, vol. 10769, pp. 407\u2013436. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-76578-5_14"},{"key":"15_CR20","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 Press (1983)","DOI":"10.1145\/800061.808749"},{"key":"15_CR21","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). \nhttps:\/\/doi.org\/10.1007\/978-3-662-47989-6_1"},{"key":"15_CR22","unstructured":"Laarhoven, T.: Search problems in cryptography. Ph.D. thesis, Eindhoven University of Technology (2016). \nhttp:\/\/repository.tue.nl\/837539"},{"key":"15_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/978-3-319-69453-5_28","volume-title":"Selected Areas in Cryptography \u2013 SAC 2016","author":"T Laarhoven","year":"2017","unstructured":"Laarhoven, T.: Sieving for closest lattice vectors (with preprocessing). In: Avanzi, R., Heys, H. (eds.) SAC 2016. LNCS, vol. 10532, pp. 523\u2013542. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-69453-5_28"},{"key":"15_CR24","unstructured":"Laarhoven, T.: Approximate Voronoi cells for lattices, revisited. In: Proceedings of the 1st MATHCRYPT (2019). \nhttps:\/\/arxiv.org\/pdf\/1907.04630.pdf"},{"key":"15_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-319-79063-3_14","volume-title":"Post-Quantum Cryptography","author":"T Laarhoven","year":"2018","unstructured":"Laarhoven, T., Mariano, A.: Progressive lattice sieving. In: Lange, T., Steinwandt, R. (eds.) PQCrypto 2018. LNCS, vol. 10786, pp. 292\u2013311. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-79063-3_14"},{"key":"15_CR26","unstructured":"Laarhoven, T., van de Pol, J., de Weger, B.: Solving hard lattice problems and the security of lattice-based cryptosystems. Cryptology ePrint Archive, Report 2012\/533, pp. 1\u201343 (2012). \nhttp:\/\/eprint.iacr.org\/2012\/533"},{"key":"15_CR27","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 42nd STOC, pp. 351\u2013358. ACM Press (2010)","DOI":"10.1145\/1806689.1806739"},{"key":"15_CR28","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Voulgaris, P.: Faster exponential time algorithms for the shortest vector problem. In: Proceedings of the 21st SODA, pp. 1468\u20131480. ACM-SIAM (2010)","DOI":"10.1137\/1.9781611973075.119"},{"key":"15_CR29","doi-asserted-by":"publisher","unstructured":"Micciancio, D., Walter, M.: Fast lattice point enumeration with minimal overhead. In: Proceedings of the 26th SODA, pp. 276\u2013294 (2015). \nhttps:\/\/doi.org\/10.1137\/1.9781611973730.21","DOI":"10.1137\/1.9781611973730.21"},{"issue":"2","key":"15_CR30","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. Cryptol. 2(2), 181\u2013207 (2008)","journal-title":"J. Math. Cryptol."},{"issue":"2","key":"15_CR31","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 time lattice basis reduction algorithms. Theoret. Comput. Sci. 53(2), 201\u2013224 (1987)","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR32","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). \nhttps:\/\/doi.org\/10.1007\/3-540-36494-3_14"},{"issue":"2","key":"15_CR33","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1137\/060676362","volume":"23","author":"N Sommer","year":"2009","unstructured":"Sommer, N., Feder, M., Shalvi, O.: Finding the closest lattice point by iterative slicing. SIAM J. Discrete Math. 23(2), 715\u2013731 (2009). \nhttps:\/\/doi.org\/10.1137\/060676362","journal-title":"SIAM J. Discrete Math."},{"key":"15_CR34","unstructured":"The FPLLL development team: fplll, a lattice reduction library (2019). \nhttps:\/\/github.com\/fplll\/fplll"},{"key":"15_CR35","unstructured":"The g6k development team: The general sieve kernel (G6K) (2019). \nhttps:\/\/github.com\/fplll\/g6k"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology - AFRICACRYPT 2020"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-51938-4_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,8]],"date-time":"2020-07-08T23:12:26Z","timestamp":1594249946000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-51938-4_15"}},"subtitle":["Hybrid Lattice Algorithms for SVP via CVPP"],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030519377","9783030519384"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-51938-4_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"5 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AFRICACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in Africa","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cairo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Egypt","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 July 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"africacrypt2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/africacrypt2020.org\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"49","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4.2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}