{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:25:17Z","timestamp":1742999117779,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":22,"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_3","type":"book-chapter","created":{"date-parts":[[2020,12,10]],"date-time":"2020-12-10T20:08:45Z","timestamp":1607630925000},"page":"29-42","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Solving the Search-LWE Problem by Lattice Reduction over Projected Bases"],"prefix":"10.1007","author":[{"given":"Satoshi","family":"Nakamura","sequence":"first","affiliation":[]},{"given":"Nariaki","family":"Tateiwa","sequence":"additional","affiliation":[]},{"given":"Koha","family":"Kinjo","sequence":"additional","affiliation":[]},{"given":"Yasuhiko","family":"Ikematsu","sequence":"additional","affiliation":[]},{"given":"Masaya","family":"Yasuda","sequence":"additional","affiliation":[]},{"given":"Katsuki","family":"Fujisawa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,12,11]]},"reference":[{"key":"3_CR1","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. Springer, Berlin, pp 351\u2013367","DOI":"10.1007\/978-3-319-98113-0_19"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Albrecht MR, G\u00f6pfert F, Virdia F, Wunderer T (2017) Revisiting the expected cost of solving uSVP and applications to LWE. In: Advances in cryptology\u2013EUROCRYPT 2017. Lecture notes in computer science, vol 10624. Springer, Berlin, pp 297\u2013322","DOI":"10.1007\/978-3-319-70694-8_11"},{"issue":"3","key":"3_CR3","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1515\/jmc-2015-0016","volume":"9","author":"MR Albrecht","year":"2015","unstructured":"Albrecht MR, Player R, Scott S (2015) On the concrete hardness of learning with errors. J Math Cryptol 9(3):169\u2013203","journal-title":"J Math Cryptol"},{"key":"3_CR4","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 9665. Springer, Berlin, 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":"3_CR5","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":"3_CR6","doi-asserted-by":"crossref","unstructured":"Buchmann J, B\u00fcscher N, G\u00f6pfert F, Katzenbeisser S, Kr\u00e4mer J, Micciancio D, Siim S, van Vredendaal C, Walter M (2016) Creating cryptographic challenges using multi-party computation: The LWE challenge. In: ASIA public-key cryptography (AsiaPKC 2016). ACM, pp 11\u201320","DOI":"10.1145\/2898420.2898422"},{"key":"3_CR7","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 7073. Springer, Berlin, pp 1\u201320"},{"key":"3_CR8","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 6110, Springer, Berlin, pp 257\u2013278"},{"issue":"3","key":"3_CR9","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 Res 12(3):415\u2013440","journal-title":"Math Oper Res"},{"issue":"4","key":"3_CR10","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. Mathematische Annalen 261(4):515\u2013534","journal-title":"Mathematische Annalen"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Micciancio D, Regev O, Lattice-based cryptography. In Post-quantum cryptography, pp 147\u2013191 (2009)","DOI":"10.1007\/978-3-540-88702-7_5"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Nguyen PQ (2009) Hermite\u2019s constant and lattice algorithms. In: The LLL algorithm. Springer, Berlin, pp 19\u201369","DOI":"10.1007\/978-3-642-02295-1_2"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Regev O (2005) On lattices, learning with errors, random linear codes, and cryptography. In: Symposium on theory of computing (STOC 2005). ACM, pp 84\u201393","DOI":"10.1145\/1060590.1060603"},{"issue":"2\u20133","key":"3_CR14","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. Theor Comput Sci 53(2\u20133):201\u2013224","journal-title":"Theor Comput Sci"},{"key":"3_CR15","unstructured":"Schnorr CP (1992) Block Korkin-Zolotarev bases and successive minima. In: International computer science institute"},{"key":"3_CR16","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":"3_CR17","unstructured":"Shoup V NTL: a library for doing number theory. https:\/\/www.shoup.net\/ntl\/"},{"key":"3_CR18","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":"3_CR19","unstructured":"Wang Y, Aono Y, Takagi T (2017) An experimental study of Kannan\u2019s embedding technique for the search LWE problem. In: International Conference on Information and Communications Security (ICICS 2017). Lecture notes in computer science, vol 10631. Springer, Berlin, pp 541\u2013553"},{"key":"3_CR20","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, Berlin, pp 142\u2013160"},{"key":"3_CR21","doi-asserted-by":"publisher","first-page":"2489","DOI":"10.1007\/s10623-019-00634-9","volume":"87","author":"M Yasuda","year":"2019","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. Des Codes Crypt 87:2489\u20132505","journal-title":"Des Codes Crypt"},{"key":"3_CR22","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, Berlin, pp 162\u2013182","DOI":"10.1007\/978-3-319-89339-6_10"}],"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_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,10]],"date-time":"2020-12-10T20:11:48Z","timestamp":1607631108000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-8061-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,11]]},"ISBN":["9789811580604","9789811580611"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-8061-1_3","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"}}]}}