{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:26:51Z","timestamp":1742974011919,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":28,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811580604"},{"type":"electronic","value":"9789811580611"}],"license":[{"start":{"date-parts":[[2020,12,11]],"date-time":"2020-12-11T00:00:00Z","timestamp":1607644800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,12,11]],"date-time":"2020-12-11T00:00:00Z","timestamp":1607644800000},"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":[[2021]]},"DOI":"10.1007\/978-981-15-8061-1_30","type":"book-chapter","created":{"date-parts":[[2020,12,10]],"date-time":"2020-12-10T20:08:45Z","timestamp":1607630925000},"page":"377-391","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Dynamic Self-dual DeepBKZ Lattice Reduction with Free Dimensions"],"prefix":"10.1007","author":[{"given":"Satoshi","family":"Nakamura","sequence":"first","affiliation":[]},{"given":"Yasuhiko","family":"Ikematsu","sequence":"additional","affiliation":[]},{"given":"Masaya","family":"Yasuda","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,12,11]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Albrecht M, Ducas L, Herold G, Kirshanova E, Postlethwaite EW, Stevens M (2019) The general sieve kernel and new records in lattice reduction. IACR ePrint 2019\/089","DOI":"10.1007\/978-3-030-17656-3_25"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"Albrecht MR, Curtis BR, Deo A, Davidson A, Player R, Postlethwaite EW, Virdia F, Wunderer T (2018) Estimate all the LWE, NTRU schemes! In: Security and cryptography for networks (SCN 2018). Lecture Notes in Computer Science, vol 11035, pp 351\u2013367","DOI":"10.1007\/978-3-319-98113-0_19"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Aono Y, Wang Y, Hayashi T, Takagi T (2016) Improved progressive BKZ algorithms and their precise cost estimation by sharp simulator. In: Advances in Cryptology\u2013EUROCRYPT 2016. Lecture Notes in Computer Science, vol\u00a09665. Springer, pp. 789\u2013819. progressive BKZ library is available from https:\/\/www2.nict.go.jp\/security\/pbkzcode\/","DOI":"10.1007\/978-3-662-49890-3_30"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"Bremner MR (2011) Lattice basis reduction: an introduction to the LLL algorithm and its applications. CRC Press","DOI":"10.1201\/b11066"},{"key":"30_CR5","unstructured":"Chen Y (2013) R\u00e9duction de r\u00e9seau et s\u00e9curit\u00e9 concrete du chiffrement completement homomorphe. PhD thesis, Paris 7"},{"key":"30_CR6","unstructured":"Chen Y, Nguyen PQ (2011) BKZ 2.0: Better lattice security estimates. In: Advances in Cryptology\u2013ASIACRYPT 2011. Lecture Notes in Computer Science, vol\u00a07073. Springer, pp 1\u201320"},{"key":"30_CR7","unstructured":"Darmstadt T. SVP challenge, available at https:\/\/www.latticechallenge.org\/svp-challenge\/"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Galbraith SD (2012) Mathematics of public key cryptography. Cambridge University Press","DOI":"10.1017\/CBO9781139012843"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"Gama N, Nguyen PQ (2008) Finding short lattice vectors within Mordell\u2019s inequality. In: Symposium on theory of computing (STOC 2008). ACM, pp 207\u2013216","DOI":"10.1145\/1374376.1374408"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Gama N, Nguyen PQ (2008) Predicting lattice reduction. In: Advances in cryptology\u2013EUROCRYPT 2008. Lecture Notes in Computer Science, vol\u00a04965. Springer, pp 31\u201351","DOI":"10.1007\/978-3-540-78967-3_3"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"Gama N, Nguyen PQ, Regev O (2010) Lattice enumeration using extreme pruning. In: Advances in cryptology\u2013EUROCRYPT 2010. Lecture Notes in Computer Science, vol\u00a06110. Springer, pp 257\u2013278","DOI":"10.1007\/978-3-642-13190-5_13"},{"issue":"3","key":"30_CR12","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1287\/moor.12.3.415","volume":"12","author":"R Kannan","year":"1987","unstructured":"Kannan R (1987) Minkowski\u2019s convex body theorem and integer programming. Math Oper Rese 12(3):415\u2013440","journal-title":"Math Oper Rese"},{"issue":"4","key":"30_CR13","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"AK Lenstra","year":"1982","unstructured":"Lenstra AK, Lenstra HW, Lov\u00e1sz L (1982) Factoring polynomials with rational coefficients. Math Ann 261(4):515\u2013534","journal-title":"Math Ann"},{"key":"30_CR14","doi-asserted-by":"crossref","unstructured":"Micciancio D, Walter M (2016) Practical, predictable lattice basis reduction. In: Advances in cryptology\u2013EUROCRYPT 2016. Lecture Notes in Computer Science, vol\u00a09665. Springer, pp. 820\u2013849","DOI":"10.1007\/978-3-662-49890-3_31"},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"Nguyen PQ (2009) Hermite\u2019s constant and lattice algorithms. In: The LLL algorithm. Springer, pp 19\u201369","DOI":"10.1007\/978-3-642-02295-1_2"},{"issue":"2\u20133","key":"30_CR16","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0304-3975(87)90064-8","volume":"53","author":"CP Schnorr","year":"1987","unstructured":"Schnorr CP (1987) A hierarchy of polynomial time lattice basis reduction algorithms. Theoret Comput Sci 53(2\u20133):201\u2013224","journal-title":"Theoret Comput Sci"},{"key":"30_CR17","unstructured":"Schnorr CP (1992). Block Korkin-Zolotarev bases and successive minima. International Computer Science Institute"},{"key":"30_CR18","doi-asserted-by":"crossref","unstructured":"Schnorr CP (2003) Lattice reduction by random sampling and birthday methods. In: Symposium on theoretical aspects of computer science (STACS 2003). Lecture Notes in Computer Science, vol\u00a02607. Springer, pp. 145\u2013156","DOI":"10.1007\/3-540-36494-3_14"},{"key":"30_CR19","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01581144","volume":"66","author":"CP Schnorr","year":"1994","unstructured":"Schnorr CP, Euchner M (1994) Lattice basis reduction: improved practical algorithms and solving subset sum problems. Math Program 66:181\u2013199","journal-title":"Math Program"},{"key":"30_CR20","unstructured":"Shoup V NTL: a library for doing number theory. https:\/\/www.shoup.net\/ntl\/"},{"key":"30_CR21","unstructured":"The FPLLL development team: fplll, a lattice reduction library (2016), https:\/\/github.com\/fplll\/fplll"},{"key":"30_CR22","unstructured":"The FPyLLL development team: fpylll, a lattice reduction library (2018), https:\/\/github.com\/fplll\/fpylll"},{"key":"30_CR23","unstructured":"The National Institute of Standards and Technology (NIST): Post-quantum cryptography, https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/post-quantum-cryptography-standardization"},{"key":"30_CR24","unstructured":"Yamaguchi J, Yasuda M (2017) Explicit formula for Gram-Schmidt vectors in LLL with deep insertions and its applications. In: Number-theoretic methods in cryptology (NuTMiC 2017). Lecture Notes in Computer Science, vol 10737. Springer, pp. 142\u2013160"},{"key":"30_CR25","unstructured":"Yasuda M (2018) Self-dual DeepBKZ for finding short lattice vectors. Presented at MathCrypt 2018 (to appear in a MathCrypt 2018 special issue of Journal of Mathematical Cryptology)"},{"key":"30_CR26","doi-asserted-by":"crossref","unstructured":"Yasuda M, Yamaguchi J (2019) A new polynomial-time variant of LLL with deep insertions for decreasing the squared-sum of Gram-Schmidt lengths. Designs, Codes and Cryptography, First Online","DOI":"10.1007\/s10623-019-00634-9"},{"key":"30_CR27","doi-asserted-by":"crossref","unstructured":"Yasuda M, Yamaguchi J, Ooka M, Nakamura S (2018) Development of a dual version of DeepBKZ and its application to solving the LWE challenge. In: Progress in cryptology\u2013AFRICACRYPT 2018. Lecture Notes in Computer Science, vol 10831. Springer, pp 162\u2013182","DOI":"10.1007\/978-3-319-89339-6_10"},{"key":"30_CR28","unstructured":"Yu Y, Ducas L (2017) Second order statistical behavior of LLL and BKZ. In: Selected areas in cryptography (SAC 2017). Lecture Notes in Computer Science, vol 10719. Springer, pp. 3\u201322"}],"container-title":["Advances in Intelligent Systems and Computing","Proceedings of the Sixth International Conference on Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-8061-1_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,4]],"date-time":"2022-12-04T01:53:44Z","timestamp":1670118824000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-8061-1_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,11]]},"ISBN":["9789811580604","9789811580611"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-8061-1_30","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2020,12,11]]},"assertion":[{"value":"11 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}