{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:59:26Z","timestamp":1764997166323},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319893389"},{"type":"electronic","value":"9783319893396"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-89339-6_10","type":"book-chapter","created":{"date-parts":[[2018,4,4]],"date-time":"2018-04-04T21:32:30Z","timestamp":1522877550000},"page":"162-182","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Development of a Dual Version of\u00a0DeepBKZ and Its Application to\u00a0Solving the LWE Challenge"],"prefix":"10.1007","author":[{"given":"Masaya","family":"Yasuda","sequence":"first","affiliation":[]},{"given":"Junpei","family":"Yamaguchi","sequence":"additional","affiliation":[]},{"given":"Michiko","family":"Ooka","sequence":"additional","affiliation":[]},{"given":"Satoshi","family":"Nakamura","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,4,6]]},"reference":[{"issue":"3","key":"10_CR1","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1515\/jmc-2015-0016","volume":"9","author":"MR Albrecht","year":"2015","unstructured":"Albrecht, M.R., Player, R., Scott, S.: On the concrete hardness of learning with errors. J. Math. Cryptol. 9(3), 169\u2013203 (2015)","journal-title":"J. Math. Cryptol."},{"key":"10_CR2","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 . http:\/\/www2.nict.go.jp\/security\/pbkzcode\/"},{"key":"10_CR3","unstructured":"Bindel, N., Buchmann, J., G\u00f6pfert, F., Schmidt, M.: Estimation of the hardness of the learning with errors problem with a restricted number of samples, IACR ePrint 2017\/140 https:\/\/eprint.iacr.org\/2017\/140 (2017)"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/3-540-45022-X_22","volume-title":"Automata, Languages and Programming","author":"J Bl\u00f6mer","year":"2000","unstructured":"Bl\u00f6mer, J.: Closest vectors, successive minima, and dual HKZ-bases of lattices. In: Montanari, U., Rolim, J.D.P., Welzl, E. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 248\u2013259. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45022-X_22"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Bremner, M.R.: Lattice Basis Reduction: An Introduction to the LLL Algorithm and Its Applications. CRC Press, Boca Raton (2011)","DOI":"10.1201\/b11066"},{"key":"10_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.: Creating cryptographic challenges using multi-party computation: the LWE challenge. In: International Workshop on ASIA Public-Key Cryptography-ASIAPKC 2016, pp. 11\u201320. ACM (2016)","DOI":"10.1145\/2898420.2898422"},{"key":"10_CR7","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":"10_CR8","doi-asserted-by":"publisher","unstructured":"Cohen, H.: A Course in Computational Algebraic Number Theory. Graduate Texts in Mathematics, vol. 138. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/978-3-662-02945-9","DOI":"10.1007\/978-3-662-02945-9"},{"key":"10_CR9","unstructured":"T. U. Darmstadt, Lattice Challenge. http:\/\/www.latticechallenge.org\/svp-challenge\/"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Gama, N., Nguyen, P.Q.: Finding short lattice vectors within Mordell\u2019s inequality. In: Symposium on the Theory of Computing, STOC 2008, pp. 207\u2013216. ACM (2008)","DOI":"10.1145\/1374376.1374408"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-642-13190-5_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"N Gama","year":"2010","unstructured":"Gama, N., Nguyen, P.Q., Regev, O.: Lattice enumeration using extreme pruning. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 257\u2013278. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_13"},{"key":"10_CR12","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":"10_CR13","unstructured":"Koy, H.: Primal\/duale segment-reduktion von Gitterbasen, Lecture Universit\u00e4t Frankfurt (2000)"},{"issue":"4","key":"10_CR14","doi-asserted-by":"crossref","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":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-642-36095-4_19","volume-title":"Topics in Cryptology \u2013 CT-RSA 2013","author":"M Liu","year":"2013","unstructured":"Liu, M., Nguyen, P.Q.: Solving BDD by enumeration: an update. In: Dawson, E. (ed.) CT-RSA 2013. LNCS, vol. 7779, pp. 293\u2013309. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36095-4_19"},{"key":"10_CR16","doi-asserted-by":"publisher","unstructured":"Micciancio D., Goldwasser, S.: Complexity of Lattice Problems: A Cryptographic Perspective. Springer Science & Business Media, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-1-4615-0897-7","DOI":"10.1007\/978-1-4615-0897-7"},{"key":"10_CR17","doi-asserted-by":"publisher","unstructured":"Micciancio, D., Regev, O.: Lattice-based cryptography. In: Bernstein, D.J., Buchmann, J., Dahmen, E. (eds.) Post-Quantum Cryptography, pp. 147\u2013191. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-540-88702-7_5","DOI":"10.1007\/978-3-540-88702-7_5"},{"key":"10_CR18","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":"10_CR19","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Symposium on the Theory of Computing, STOC 2005, pp. 84\u201393. ACM (2005)","DOI":"10.1145\/1060590.1060603"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/3-540-36494-3_14","volume-title":"STACS 2003","author":"CP Schnorr","year":"2003","unstructured":"Schnorr, C.P.: Lattice reduction by random sampling and birthday methods. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol. 2607, pp. 145\u2013156. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36494-3_14"},{"key":"10_CR21","doi-asserted-by":"crossref","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":"10_CR22","unstructured":"Shoup, V.: NTL: A Library for doing Number Theory. http:\/\/www.shoup.net\/ntl\/"},{"key":"10_CR23","unstructured":"The FPLLL development team, fplll, a lattice reduction library (2016). https:\/\/github.com\/fplll\/fplll"},{"key":"10_CR24","doi-asserted-by":"crossref","unstructured":"Wang, Y., Aono, Y., Takagi, T.: An experimental study of Kannan\u2019s embedding technique for the search LWE problem. In: International Conference on Information and Communication Security, ICICS 2017 (2017, to appear)","DOI":"10.1007\/978-3-319-89500-0_47"},{"key":"10_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-319-61204-1_13","volume-title":"Applied Cryptography and Network Security","author":"R Xu","year":"2017","unstructured":"Xu, R., Yeo, S.L., Fukushima, K., Takagi, T., Seo, H., Kiyomoto, S., Henricksen, M.: An experimental study of the BDD approach for the search LWE problem. In: Gollmann, D., Miyaji, A., Kikuchi, H. (eds.) ACNS 2017. LNCS, vol. 10355, pp. 253\u2013272. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-61204-1_13"},{"key":"10_CR26","doi-asserted-by":"publisher","unstructured":"Yamaguchi, J., Yasuda, M.: Explicit formula for Gram-Schmidt vectors in LLL with deep insertions and its applications. In: Kaczorowski, J., Pieprzyk, J., Pomyka\u0142a, J. (eds.) NuTMiC 2017. LNCS, vol. 10737, pp. 142\u2013160. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-76620-1_9","DOI":"10.1007\/978-3-319-76620-1_9"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 AFRICACRYPT 2018"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-89339-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,14]],"date-time":"2019-10-14T00:07:27Z","timestamp":1571011647000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-89339-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319893389","9783319893396"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-89339-6_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}