{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:48:00Z","timestamp":1759063680294,"version":"3.37.3"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T00:00:00Z","timestamp":1555632000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T00:00:00Z","timestamp":1555632000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003382","name":"Core Research for Evolutional Science and Technology","doi-asserted-by":"publisher","award":["JPMJCR14D6"],"award-info":[{"award-number":["JPMJCR14D6"]}],"id":[{"id":"10.13039\/501100003382","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["JP16H02830"],"award-info":[{"award-number":["JP16H02830"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1007\/s10623-019-00634-9","type":"journal-article","created":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T08:03:47Z","timestamp":1555661027000},"page":"2489-2505","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["A new polynomial-time variant of LLL with deep insertions for decreasing the squared-sum of Gram\u2013Schmidt lengths"],"prefix":"10.1007","volume":"87","author":[{"given":"Masaya","family":"Yasuda","sequence":"first","affiliation":[]},{"given":"Junpei","family":"Yamaguchi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,19]]},"reference":[{"key":"634_CR1","unstructured":"Ajtai M.: Generating random lattices according to the invariant distribution, Draft of March (2006)."},{"key":"634_CR2","first-page":"65","volume-title":"Lecture Notes in Computer Science","author":"Yoshinori Aono","year":"2017","unstructured":"Aono Y., Nguyen P.Q.: Random sampling revisited: Lattice enumeration with discrete pruning. In: Advances in Cryptology\u2014EUROCRYPT 2017, Lecture Notes in Computer Science. 10211, pp. 65\u2013102 (2017)."},{"key":"634_CR3","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":"Yoshinori 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: Advances in Cryptology\u2014EUROCRYPT 2016, Lecture Notes in Computer Science 9665, pp. 789\u2013819 (2016)."},{"issue":"1","key":"634_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02579403","volume":"6","author":"L Babai","year":"1986","unstructured":"Babai L.: On Lov\u00e1sz\u2019 lattice reduction and the nearest lattice point problem. Combinatorica 6(1), 1\u201313 (1986).","journal-title":"Combinatorica"},{"key":"634_CR5","doi-asserted-by":"publisher","DOI":"10.1201\/b11066","volume-title":"Lattice Basis Reduction: An Introduction to the LLL Algorithm and Its Applications","author":"MR Bremner","year":"2011","unstructured":"Bremner M.R.: Lattice Basis Reduction: An Introduction to the LLL Algorithm and Its Applications. CRC Press, Boca Raton (2011)."},{"key":"634_CR6","first-page":"1","volume-title":"Lecture Notes in Computer Science","author":"Yuanmi Chen","year":"2011","unstructured":"Chen Y., Nguyen P.Q.: BKZ 2.0: better lattice security estimates. In: Advances in Cryptology\u2014ASIACRYPT 2011, Lecture Notes in Computer Science 7073, pp. 1\u201320 (2011)."},{"key":"634_CR7","series-title":"Graduate Texts in Math","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02945-9","volume-title":"A Course in Computational Algebraic Number Theory","author":"H Cohen","year":"1993","unstructured":"Cohen H.: A Course in Computational Algebraic Number Theory, vol. 138. Graduate Texts in MathSpringer, Berlin (1993)."},{"key":"634_CR8","unstructured":"Darmstadt T.U.: SVP Challenge. \n                    http:\/\/www.latticechallenge.org\/svp-challenge\/\n                    \n                  ."},{"key":"634_CR9","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\u00e9o Ducas","year":"2018","unstructured":"Ducas L.: Shortest vector from lattice sieving: a few dimensions for free. In: Advances in Cryptology\u2014EUROCRYPT 2018, Lecture Notes in Computer Science 10820, pp. 125\u2013145 (2018)."},{"issue":"1","key":"634_CR10","first-page":"1","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), 1\u201315 (2015).","journal-title":"J. Inf. Process."},{"key":"634_CR11","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s10623-014-9918-8","volume":"73","author":"F Fontein","year":"2014","unstructured":"Fontein F., Schneider M., Wagner U.: PotLLL: a polynomial time version of LLL with deep insertions. Des. Codes Cryptogr. 73, 355\u2013368 (2014).","journal-title":"Des. Codes Cryptogr."},{"key":"634_CR12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139012843","volume-title":"Mathematics of Public Key Cryptography","author":"SD Galbraith","year":"2012","unstructured":"Galbraith S.D.: Mathematics of Public Key Cryptography. Cambridge University Press, Cambridge (2012)."},{"key":"634_CR13","unstructured":"Gama N., Nguyen P.Q.: Predicting lattice reduction. In: Advances in Cryptology\u2014EUROCRYPT 2008, Lecture Notes in Computer Science 4965, pp. 31\u201351 (2008)."},{"key":"634_CR14","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1515\/form.2003.009","volume":"15","author":"D Goldstein","year":"2003","unstructured":"Goldstein D., Mayer A.: On the equidistribution of Hecke points. Forum Math. 15, 165\u2013189 (2003).","journal-title":"Forum Math."},{"key":"634_CR15","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":"Guillaume Hanrot","year":"2011","unstructured":"Hanrot G., Pujol X., Stehl\u00e9 D.: Analyzing blockwise lattice algorithms using dynamical systems. In: Advances in Cryptology\u2014CRYPTO 2011, Lecture Notes in Computer Science 6841, pp. 447\u2013464 (2011)."},{"key":"634_CR16","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/BF01442795","volume":"6","author":"A Korkine","year":"1873","unstructured":"Korkine A., Zolotarev G.: Sur les formes quadratiques. Math. Ann. 6, 366\u2013389 (1873).","journal-title":"Math. Ann."},{"issue":"4","key":"634_CR17","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. Ann. 261(4), 515\u2013534 (1982).","journal-title":"Math. Ann."},{"key":"634_CR18","unstructured":"Matsuda Y., Teruya T., Kashiwabara K.: Estimation of the success probability of random sampling by the Gram\u2013Charlier approximation. IACR ePrint 2018\/815 (2018)."},{"key":"634_CR19","volume-title":"Complexity of Lattice Problems: A Cryptographic Perspective","author":"D Micciancio","year":"2012","unstructured":"Micciancio D., Goldwasser S.: Complexity of Lattice Problems: A Cryptographic Perspective. Springer, New York (2012)."},{"key":"634_CR20","doi-asserted-by":"crossref","unstructured":"Nguyen Q., Vall\u00e9e B.: The LLL Algorithm. Information Security Cryptography (2010).","DOI":"10.1007\/978-3-642-02295-1"},{"key":"634_CR21","first-page":"145","volume-title":"Lecture Notes in Computer Science","author":"Claus Peter Schnorr","year":"2003","unstructured":"Schnorr C.P.: Lattice reduction by random sampling and birthday methods. In: International Symposium on Theoretical Aspects of Computer Science\u2014STACS 2003, Lecture Notes in Computer Science 2606, pp. 145\u2013156 (2003)."},{"key":"634_CR22","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."},{"key":"634_CR23","unstructured":"Shoup V.: NTL: a library for doing number theory. \n                    http:\/\/www.shoup.net\/ntl\/\n                    \n                  ."},{"key":"634_CR24","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/978-3-319-76578-5_15","volume-title":"Public-Key Cryptography \u2013 PKC 2018","author":"Tadanori Teruya","year":"2018","unstructured":"Teruya T., Kashiwabara K., Hanaoka G.: Fast lattice basis reduction suitable for massive parallelization and its application to the shortest vector problem. In: Public-Key Cryptography\u2014PKC 2018, Lecture Notes in Computer Science 10769, pp. 437\u2013460 (2018)."},{"key":"634_CR25","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-319-76620-1_9","volume-title":"Number-Theoretic Methods in Cryptology","author":"Junpei Yamaguchi","year":"2018","unstructured":"Yamaguchi J., Yasuda M.: Explicit formula for Gram\u2013Schmidt vectors in LLL with deep insertions and its applications. In: Number-Theoretic Methods in Cryptology\u2014NuTMiC 2017, Lecture Notes in Computer Science 10737, pp. 142\u2013160 (2018)."},{"issue":"1","key":"634_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1515\/jmc-2016-0008","volume":"11","author":"M Yasuda","year":"2017","unstructured":"Yasuda M., Yokoyama K., Shimoyama T., Kogure J., Koshiba T.: Analysis of decreasing squared-sum of Gram\u2013Schmidt lengths for short lattice vectors. J. Math. Cryptol. 11(1), 1\u201324 (2017).","journal-title":"J. Math. Cryptol."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-019-00634-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-019-00634-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-019-00634-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T13:38:32Z","timestamp":1589722712000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-019-00634-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,19]]},"references-count":26,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["634"],"URL":"https:\/\/doi.org\/10.1007\/s10623-019-00634-9","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2019,4,19]]},"assertion":[{"value":"15 March 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 March 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 April 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 April 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}