{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T18:22:01Z","timestamp":1725906121382},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319641997"},{"type":"electronic","value":"9783319642000"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-64200-0_2","type":"book-chapter","created":{"date-parts":[[2017,7,26]],"date-time":"2017-07-26T12:58:41Z","timestamp":1501073921000},"page":"19-35","source":"Crossref","is-referenced-by-count":1,"title":["The Beauty and the Beasts\u2014The Hard Cases in LLL Reduction"],"prefix":"10.1007","author":[{"given":"Saed","family":"Alsayigh","sequence":"first","affiliation":[]},{"given":"Jintai","family":"Ding","sequence":"additional","affiliation":[]},{"given":"Tsuyoshi","family":"Takagi","sequence":"additional","affiliation":[]},{"given":"Yuntao","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,27]]},"reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/10719839_35","volume-title":"LATIN 2000: Theoretical Informatics","author":"A Akhavi","year":"2000","unstructured":"Akhavi, A.: Worst-case complexity of the optimal LLL algorithm. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol. 1776, pp. 355\u2013366. Springer, Heidelberg (2000). doi:\n      10.1007\/10719839_35"},{"issue":"1\u20133","key":"2_CR2","first-page":"323","volume":"297","author":"A Akhavi","year":"2003","unstructured":"Akhavi, A.: The optimal LLL algorithm is still polynomial in fixed dimension. Theor. Comput. Sci. 297(1\u20133), 323 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-642-54631-0_11","volume-title":"Public-Key Cryptography \u2013 PKC 2014","author":"J Bi","year":"2014","unstructured":"Bi, J., Coron, J.-S., Faug\u00e8re, J.-C., Nguyen, P.Q., Renault, G., Zeitoun, R.: Rounding and chaining LLL: finding faster small roots of univariate polynomial congruences. In: Krawczyk, H. (ed.) PKC 2014. LNCS, vol. 8383, pp. 185\u2013202. Springer, Heidelberg (2014). doi:\n      10.1007\/978-3-642-54631-0_11"},{"issue":"2","key":"2_CR4","doi-asserted-by":"crossref","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 Mathematicum 15(2), 165\u2013189 (2003)","journal-title":"Forum Mathematicum"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-78967-3_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"N Gama","year":"2008","unstructured":"Gama, N., Nguyen, P.Q.: Predicting lattice reduction. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 31\u201351. Springer, Heidelberg (2008). doi:\n      10.1007\/978-3-540-78967-3_3"},{"key":"2_CR6","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). doi:\n      10.1007\/978-3-642-13190-5_13"},{"key":"2_CR7","unstructured":"Lagrange, L.: \u201cRecherches d\u2019arithm\u00e9tique\u201d. Nouv. M\u00e9m. Acad. (1773)"},{"issue":"9","key":"2_CR8","doi-asserted-by":"crossref","first-page":"2853","DOI":"10.1109\/TWC.2010.072210.100023","volume":"9","author":"L Luzzi","year":"2010","unstructured":"Luzzi, L., Othman, G.R., Belfiore, J.C.: Augmented lattice reduction for MIMO decoding. IEEE Trans. Wireless Commun. 9(9), 2853\u20132859 (2010)","journal-title":"IEEE Trans. Wireless Commun."},{"issue":"4","key":"2_CR9","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"AK Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra Jr., H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Math. Ann. 261(4), 515\u2013534 (1982)","journal-title":"Math. Ann."},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-13190-5_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"V Lyubashevsky","year":"2010","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 1\u201323. Springer, Heidelberg (2010). doi:\n      10.1007\/978-3-642-13190-5_1"},{"issue":"5","key":"2_CR11","doi-asserted-by":"crossref","first-page":"2960","DOI":"10.1109\/TIT.2012.2236144","volume":"59","author":"L Luzzi","year":"2013","unstructured":"Luzzi, L., Stehl\u00e9, D., Ling, C.: Decoding by embedding: correct decoding radius and DMT optimality. IEEE Trans. Inf. Theory 59(5), 2960\u20132973 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2_CR12","unstructured":"Magma computational algebra system. \n      http:\/\/magma.maths.usyd.edu.au\/magma\/"},{"key":"2_CR13","unstructured":"Minkowski, H.: Geometrie der Zahlen (1910)"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Nguyen, P.Q., Stehl\u00e9, D.: Low-dimensional lattice basis reduction revisited. ACM Trans. Algorithms 5(4) (2009)","DOI":"10.1145\/1597036.1597050"},{"key":"2_CR15","unstructured":"Victor Shoup\u2019s NTL library. \n      http:\/\/www.shoup.net\/ntl\/"},{"key":"2_CR16","series-title":"Information Security and Cryptography","volume-title":"The LLL Algorithm - Survey and Applications","year":"2010","unstructured":"Nguyen, P.Q., Vall\u00e9e, B. (eds.): The LLL Algorithm - Survey and Applications. Information Security and Cryptography. Springer, Berlin Heidelberg (2010)"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: STOC 2005, pp. 84\u201393 (2005)","DOI":"10.1145\/1060590.1060603"},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/3-540-44670-2_13","volume-title":"Cryptography and Lattices","author":"I Semaev","year":"2001","unstructured":"Semaev, I.: A 3-dimensional lattice reduction algorithm. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol. 2146, pp. 181\u2013193. Springer, Heidelberg (2001). doi:\n      10.1007\/3-540-44670-2_13"},{"issue":"1\u20133","key":"2_CR19","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(1\u20133), 181\u2013199 (1994)","journal-title":"Math. Program."},{"key":"2_CR20","unstructured":"TU Darmstadt lattice challenge. \n      http:\/\/www.latticechallenge.org\/"}],"container-title":["Lecture Notes in Computer Science","Advances in Information and Computer Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-64200-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,7,26]],"date-time":"2017-07-26T12:59:09Z","timestamp":1501073949000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-64200-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319641997","9783319642000"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-64200-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}