{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:28:52Z","timestamp":1743013732292,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030904012"},{"type":"electronic","value":"9783030904029"}],"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.springer.com\/tdm"},{"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.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-90402-9_10","type":"book-chapter","created":{"date-parts":[[2021,11,2]],"date-time":"2021-11-02T00:03:09Z","timestamp":1635811389000},"page":"174-189","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Lattice Reduction Algorithm Based on Sublattice BKZ"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9168-2438","authenticated-orcid":false,"given":"Jinzheng","family":"Cao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanbin","family":"Pan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6149-4807","authenticated-orcid":false,"given":"Qingfeng","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,11,2]]},"reference":[{"key":"10_CR1","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."},{"issue":"2","key":"10_CR2","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."},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Voulgaris, P.: Faster exponential time algorithms for the shortest vector problem. In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1468\u20131480. ACM-SIAM, Austin (2010)","DOI":"10.1137\/1.9781611973075.119"},{"key":"10_CR4","doi-asserted-by":"publisher","unstructured":"Ducas, L.: Shortest vector from lattice sieving: A few dimensions for free. In: EUROCRYPT 2018, Part I, LNCS, vol. 10820, pp. 125\u2013145. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_5","DOI":"10.1007\/978-3-319-78381-9_5"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"AK Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra, H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Math. Annalen 261, 515\u2013534 (1982)","journal-title":"Math. Annalen"},{"key":"10_CR6","doi-asserted-by":"publisher","unstructured":"Aggarwal, D., Li, J., Nguyen, P.Q., Stephens-Davidowitz, N.: Slide reduction, revisited - filling the gaps in SVP approximation. In: Advances in Cryptology - CRYPTO 2020, LNCS, vol. 12171, pp. 274\u2013295. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_10","DOI":"10.1007\/978-3-030-56880-1_10"},{"key":"10_CR7","doi-asserted-by":"publisher","unstructured":"Chen, Y., Nguyen, P.Q.: BKZ 2.0: Better lattice security estimates. In: ASIACRYPT 2011, LNCS, vol. 7073, pp. 1\u201320. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_1","DOI":"10.1007\/978-3-642-25385-0_1"},{"key":"10_CR8","doi-asserted-by":"publisher","unstructured":"Aono, Y., Wang, Y., Hayashi, T., Takagi, T.: Improved progressive BKZ algorithms and their precise cost estimation by sharp simulator. In: Advances in Cryptology - EUROCRYPT 2016, LNCS, vol. 9665, pp. 789\u2013819. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_30","DOI":"10.1007\/978-3-662-49890-3_30"},{"key":"10_CR9","doi-asserted-by":"publisher","unstructured":"Albrecht, M., Bai, S., Fouque, P.A., Kirchner, P., Stehle, D., Wen, W.: Faster enumeration-based lattice reduction : root hermite factor k1\/(2k) time kk\/8+o(k). In: Advances in Cryptology - CRYPTO 2020. LNCS, vol. 12171, pp. 186\u2013212. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_7","DOI":"10.1007\/978-3-030-56880-1_7"},{"key":"10_CR10","doi-asserted-by":"publisher","unstructured":"Nguyen, P.Q., Vallee, B.: The LLL Algorithm, Survey and Applications, 1st edn. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-02295-1","DOI":"10.1007\/978-3-642-02295-1"},{"key":"10_CR11","doi-asserted-by":"publisher","unstructured":"Micciancio, D., Walter, M.: Practical, predictable lattice basis reduction. In: Advances in Cryptology - EUROCRYPT 2016, LNCS, vol. 9665, pp. 820\u2013849. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_31","DOI":"10.1007\/978-3-662-49890-3_31"},{"key":"10_CR12","doi-asserted-by":"publisher","unstructured":"Schnorr, C.P.: Lattice reduction by random sampling and birthday methods. In: STACS 2003, LNCS, vol. 2607, pp. 145\u2013156. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36494-3_14","DOI":"10.1007\/3-540-36494-3_14"},{"key":"10_CR13","doi-asserted-by":"publisher","unstructured":"Guillaume, H., Pujol, X., Stehle, D.: Analyzing blockwise lattice algorithms using dynamical systems. In: Advances in Cryptology - CRYPTO 2011, LNCS, vol. 6841, pp. 447\u2013464. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_25","DOI":"10.1007\/978-3-642-22792-9_25"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Gama, N., Nguyen, P.Q.: Finding short lattice vectors within Mordell\u2019s inequality. In: 40th ACM STOC, pp. 207\u2013216. ACM Press, Columbia (2008)","DOI":"10.1145\/1374376.1374408"},{"key":"10_CR15","unstructured":"The FPLLL development team. FPLLL, a lattice reduction library. https:\/\/github.com\/fplll\/fplll. Accessed 25 May 2021"},{"key":"10_CR16","unstructured":"The FPLLL development team. FPyLLL, a Python interface to fplll. https:\/\/github.com\/fplll\/fpylll. Accessed 25 May 2021"}],"container-title":["Lecture Notes in Computer Science","Provable and Practical Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-90402-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,2]],"date-time":"2021-11-02T00:04:02Z","timestamp":1635811442000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-90402-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030904012","9783030904029"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-90402-9_10","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":"2 November 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ProvSec","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Provable Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"provsec2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/provsec2021.scau.edu.cn\/index\/","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":"67","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":"31% - 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":"4","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","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)"}}]}}