{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:17:32Z","timestamp":1760203052775,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030752446"},{"type":"electronic","value":"9783030752453"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-75245-3_3","type":"book-chapter","created":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T15:04:51Z","timestamp":1619795091000},"page":"45-67","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Convergence of Slide-Type Reductions"],"prefix":"10.1007","author":[{"given":"Michael","family":"Walter","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,1]]},"reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/978-3-030-56880-1_7","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"MR Albrecht","year":"2020","unstructured":"Albrecht, M.R., Bai, S., Fouque, P.-A., Kirchner, P., Stehl\u00e9, D., Wen, W.: Faster\u00a0enumeration-based\u00a0lattice\u00a0reduction: root\u00a0hermite\u00a0factor\u00a0$$k^{1\/(2k)}$$\u00a0Time\u00a0$$k^{k\/8+o(k)}$$. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12171, pp. 186\u2013212. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_7"},{"key":"3_CR2","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). https:\/\/doi.org\/10.1007\/978-3-030-17656-3_25"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-030-56880-1_10","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"D Aggarwal","year":"2020","unstructured":"Aggarwal, D., Li, J., Nguyen, P.Q., Stephens-Davidowitz, N.: Slide reduction, revisited\u2014filling the gaps in SVP approximation. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12171, pp. 274\u2013295. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_10"},{"key":"3_CR4","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). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_30"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-540-88403-3_6","volume-title":"Post-Quantum Cryptography","author":"J Buchmann","year":"2008","unstructured":"Buchmann, J., Lindner, R., R\u00fcckert, M.: Explicit hard instances of the shortest vector problem. In: Buchmann, J., Ding, J. (eds.) PQCrypto 2008. LNCS, vol. 5299, pp. 79\u201394. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-88403-3_6"},{"key":"3_CR6","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). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_1"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Dadush, D., Micciancio, D.: Algorithms for the densest sub-lattice problem. In: Khanna, S., (ed.) 24th SODA, pp. 1103\u20131122. ACM-SIAM, January 2013","DOI":"10.1137\/1.9781611973105.79"},{"key":"3_CR8","unstructured":"The FPLLL development team. fplll, a lattice reduction library (2016). https:\/\/github.com\/fplll\/fplll"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Gama, N., Nguyen, P.Q.: Finding short lattice vectors within Mordell\u2019s inequality. In: Ladner, R.E., Dwork, C., (eds.) 40th ACM STOC, pp. 207\u2013216. ACM Press, May 2008","DOI":"10.1145\/1374376.1374408"},{"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). https:\/\/doi.org\/10.1007\/978-3-540-78967-3_3"},{"key":"3_CR11","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). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_25"},{"key":"3_CR12","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-540-74143-5_10","volume-title":"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":"3_CR13","doi-asserted-by":"crossref","unstructured":"Lenstra, A.K., Lenstra Jr., H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Mathematische Annalen 261, 513\u2013534 (1982)","DOI":"10.1007\/BF01457454"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Li, J., Nguyen, P.: Approximating the densest sublattice from rankin\u2019s inequality. LMS J. Comput. Math. [electronic only], 17, 08 (2014)","DOI":"10.1112\/S1461157014000333"},{"key":"3_CR15","unstructured":"Li, J., Nguyen, P.Q.: A complete analysis of the bkz lattice reduction algorithm. Cryptology ePrint Archive, Report 2020\/1237 (2020). https:\/\/eprint.iacr.org\/2020\/1237"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L.: An algorithmic theory of numbers, graphs and convexity, vol. 50. CBMS. SIAM (1986)","DOI":"10.1137\/1.9781611970203"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1007\/978-3-662-49890-3_31","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"D Micciancio","year":"2016","unstructured":"Micciancio, D., Walter, M.: Practical, predictable lattice basis reduction. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9665, pp. 820\u2013849. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_31"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Neumaier, A.: Bounding basis reduction properties. Des. Codes Cryptogr., 84(1-2), 237\u2013259 (2017)","DOI":"10.1007\/s10623-016-0273-9"},{"key":"3_CR19","unstructured":"Pataki, G., Tural, M.: Unifying lll inequalities (2009)"},{"issue":"2\u20133","key":"3_CR20","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0304-3975(87)90064-8","volume":"53","author":"C-P Schnorr","year":"1987","unstructured":"Schnorr, C.-P.: A hierarchy of polynomial time lattice basis reduction algorithms. Theoret. Comput. Sci. 53(2\u20133), 201\u2013224 (1987)","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Schnorr, C.-P., Euchner, M.: Lattice basis reduction: Improved practical algorithms and solving subset sum problems. Mathematical Programm. 66(1\u20133), 181\u2013199, August 1994. Preliminary version in FCT 1991","DOI":"10.1007\/BF01581144"},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-319-17470-9_16","volume-title":"Information Theoretic Security","author":"M Walter","year":"2015","unstructured":"Walter, M.: Lattice point enumeration on block reduced bases. In: Lehmann, A., Wolf, S. (eds.) ICITS 2015. LNCS, vol. 9063, pp. 269\u2013282. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-17470-9_16"}],"container-title":["Lecture Notes in Computer Science","Public-Key Cryptography \u2013 PKC 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-75245-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,30]],"date-time":"2024-04-30T00:05:17Z","timestamp":1714435517000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-75245-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030752446","9783030752453"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-75245-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"1 May 2021","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 Conference on Public-Key Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 May 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pkc2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pkc.iacr.org\/2021\/","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":"Web-Submission-and-Review","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"156","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":"52","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":"33% - 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,5","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":"15","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","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"}]}}