{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T07:04:23Z","timestamp":1768719863693,"version":"3.49.0"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2016,9,15]],"date-time":"2016-09-15T00:00:00Z","timestamp":1473897600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"ERC Starting Grant","award":["ERC-2013-StG-335086-LATTAC"],"award-info":[{"award-number":["ERC-2013-StG-335086-LATTAC"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1007\/s10623-016-0273-9","type":"journal-article","created":{"date-parts":[[2016,9,15]],"date-time":"2016-09-15T01:22:59Z","timestamp":1473902579000},"page":"237-259","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Bounding basis reduction properties"],"prefix":"10.1007","volume":"84","author":[{"given":"Arnold","family":"Neumaier","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,15]]},"reference":[{"key":"273_CR1","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1155\/S1073792892000242","volume":"10","author":"K Ball","year":"1992","unstructured":"Ball K.: A lower bound for the optimal density of lattice packings. Int. Math. Res. Notes 10, 217\u2013221 (1992).","journal-title":"Int. Math. Res. Notes"},{"key":"273_CR2","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1007\/BF01454863","volume":"101","author":"HF Blichfeldt","year":"1929","unstructured":"Blichfeldt H.F.: The minimum value of quadratic forms, and the closest packing of spheres. Math. Ann. 101, 605\u2013608 (1929).","journal-title":"Math. Ann."},{"key":"273_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01201341","volume":"39","author":"HF Blichfeldt","year":"1935","unstructured":"Blichfeldt H.F.: The minimum values of positive quadratic forms in six, seven and eight variables. Math. Z. 39, 1\u201315 (1935).","journal-title":"Math. Z."},{"key":"273_CR4","doi-asserted-by":"crossref","unstructured":"Buchmann J., Lindner R., R\u00fcckert M.: Explicit hard instances of the shortest vector problem. In: Buchmann J., Ding J. (eds.) PQCrypto 2008. Lecture Notes in Computer Science, vol. 5299, pp. 79\u201394. Springer, Berlin (2008). \n                        http:\/\/latticechallenge.org","DOI":"10.1007\/978-3-540-88403-3_6"},{"key":"273_CR5","doi-asserted-by":"crossref","first-page":"689","DOI":"10.4007\/annals.2003.157.689","volume":"157","author":"H Cohn","year":"2003","unstructured":"Cohn H., Elkies N.: New upper bounds on sphere packings I. Ann. Math. 157, 689\u2013714 (2003).","journal-title":"Ann. Math."},{"key":"273_CR6","doi-asserted-by":"crossref","first-page":"1003","DOI":"10.4007\/annals.2009.170.1003","volume":"170","author":"H Cohn","year":"2009","unstructured":"Cohn H., Kumar A.: Optimality and uniqueness of the Leech lattice among lattices. Ann. Math. 170, 1003\u20131050 (2009).","journal-title":"Ann. Math."},{"key":"273_CR7","volume-title":"Sphere Packings, Lattices and Groups","author":"J Conway","year":"1998","unstructured":"Conway J., Sloane N.J.A.: Sphere Packings, Lattices and Groups, 3rd edn. Springer, Berlin (1998).","edition":"3"},{"key":"273_CR8","doi-asserted-by":"crossref","unstructured":"Coppersmith D.: Finding small solutions to small degree polynomials. In: Cryptography and Lattices, pp. 20\u201331. Springer, Berlin (2001).","DOI":"10.1007\/3-540-44670-2_3"},{"key":"273_CR9","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0304-3975(94)90071-X","volume":"123","author":"H Daud\u00e9","year":"1994","unstructured":"Daud\u00e9 H., Vall\u00e9e B.B.: An upper bound on the average number of iterations of the LLL algorithm. Theor. Comput. Sci. 123, 95\u2013115 (1994).","journal-title":"Theor. Comput. Sci."},{"key":"273_CR10","doi-asserted-by":"crossref","unstructured":"Gama N., Howgrave\u2013Graham N., Koy H., Nguyen P.Q.: Rankins constant and blockwise lattice reduction. In: Advances in Cryptology\u2014CRYPTO 2006, pp. 112\u2013130. Springer, Berlin (2006).","DOI":"10.1007\/11818175_7"},{"key":"273_CR11","doi-asserted-by":"crossref","unstructured":"Gama N., Nguyen P.Q.: Finding short lattice vectors within Mordell\u2019s inequality. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, pp. 207\u2013216. ACM (2008).","DOI":"10.1145\/1374376.1374408"},{"key":"273_CR12","doi-asserted-by":"crossref","unstructured":"Gama N., Nguyen, P.Q.: Predicting lattice reduction. In: Advances in Cryptology \u2013 EUROCRYPT 2008, pp. 31\u201351. Springer, Berlin (2008)","DOI":"10.1007\/978-3-540-78967-3_3"},{"key":"273_CR13","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1515\/form.2003.009","volume":"15","author":"D Goldstein","year":"2003","unstructured":"Goldstein D., Meyer A.: On the equidistribution of Hecke points. Forum Math. 15, 165\u2013189 (2003).","journal-title":"Forum Math."},{"key":"273_CR14","doi-asserted-by":"crossref","unstructured":"Hanrot G., Pujol, X., Stehl\u00e9 D.: Analyzing blockwise lattice algorithms using dynamical systems. In: Advances in Cryptology \u2013 CRYPTO 2011, pp. 447\u2013464. Springer, Berlin (2011) (alternative title, same content: Terminating BKZ)","DOI":"10.1007\/978-3-642-22792-9_25"},{"key":"273_CR15","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1515\/crll.1850.40.279","volume":"40","author":"C Hermite","year":"1850","unstructured":"Hermite C.: Extraits de lettres de M. Ch. Hermite \u00e1 M. Jacobi sur diff\u00e9rents objects de la th\u00e9orie des nombres, deuxi\u00e8me lettre. J. Reine Angew. Math. 40, 279\u2013290 (1850).","journal-title":"J. Reine Angew. Math."},{"key":"273_CR16","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1007\/BF01442667","volume":"11","author":"A Korkine","year":"1877","unstructured":"Korkine A., Zolotareff G.: Sur les formes quadratiques positives. Math. Ann. 11, 242\u2013292 (1877).","journal-title":"Math. Ann."},{"key":"273_CR17","unstructured":"Lagrange J.L.: Recherches d\u2019Arithm\u00e9tique. Noveaux M\u00e9moires de l\u2019Acad\u00e9mie de Berlin (1773)"},{"key":"273_CR18","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, 515\u2013534 (1982).","journal-title":"Math. Ann."},{"key":"273_CR19","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1017\/S0004972713000257","volume":"88","author":"J Li","year":"2013","unstructured":"Li J., Wei W.: Slide reduction, successive minima and several applications. Bull. Austr. Math. Soc. 88, 390\u2013406 (2013).","journal-title":"Bull. Austr. Math. Soc."},{"key":"273_CR20","volume-title":"An Algorithmic Theory of nUmbers, Graphs and Convexity","author":"L Lovasz","year":"1987","unstructured":"Lovasz L.: An Algorithmic Theory of nUmbers, Graphs and Convexity. SIAM, Philadelphia (1987)."},{"key":"273_CR21","doi-asserted-by":"crossref","unstructured":"Micciancio D., Walter M.: Practical predictable lattice basis reduction. In: Annual International Conference on Theory Applications of Cryptographic Techniques, pp. 820\u2013849. Springer, Berlin (2016). \n                        http:\/\/eprint.iacr.org\/2015\/1123","DOI":"10.1007\/978-3-662-49890-3_31"},{"key":"273_CR22","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1112\/jlms\/19.73_Part_1.3","volume":"19","author":"LJ Mordell","year":"1944","unstructured":"Mordell L.J.: Observation on the minimum of a positive quadratic form in eight variables. J. Lond. Math. Soc. 19, 3\u20136 (1944).","journal-title":"J. Lond. Math. Soc."},{"key":"273_CR23","doi-asserted-by":"crossref","unstructured":"Neumaier A., Stehl\u00e9 D.: Faster LLL-type reduction of lattice bases. In: ACM Proceedings ISSAC 2016, Waterloo, pp. 373\u2013380 (2016).","DOI":"10.1145\/2930889.2930917"},{"key":"273_CR24","doi-asserted-by":"crossref","unstructured":"Nguyen P.Q., Stehl\u00e9 D.: LLL on the average. In: Hess F. et al. (eds.) Algorithmic Number Theory. Lecture Notes in Computer Science, vol. 4076, pp. 238\u2013256. Springer, Berlin (2006).","DOI":"10.1007\/11792086_18"},{"key":"273_CR25","volume-title":"The LLL Algorithm: Survey and Applications","year":"2010","unstructured":"Nguyen P.Q., Vall\u00e9e B. (eds.): The LLL Algorithm: Survey and Applications. Springer, Berlin (2010)."},{"key":"273_CR26","doi-asserted-by":"crossref","unstructured":"Novocin A., Stehl\u00e9 D., Villard G.: An LLL-reduction algorithm with quasi-linear time complexity. In: Proceedings of the 43rd Annual ACM Symposium on Theory Computing, pp. 403\u2013412. ACM (2011).","DOI":"10.1145\/1993636.1993691"},{"key":"273_CR27","unstructured":"Pataki G., Tural M.: On sublattice determinants in reduced bases, Unpublished manuscript (2008). \n                        arXiv:0804.4014"},{"issue":"6","key":"273_CR28","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1112\/plms\/s3-6.2.305","volume":"3","author":"CA Rogers","year":"1956","unstructured":"Rogers C.A.: The number of lattice points in a set. Proc. Lond. Math. Soc 3(6), 305\u2013320 (1956).","journal-title":"Proc. Lond. Math. Soc"},{"key":"273_CR29","doi-asserted-by":"crossref","first-page":"209","DOI":"10.5802\/jtnb.712","volume":"22","author":"K Sawatani","year":"2010","unstructured":"Sawatani K., Watanabe T., Okuda K.: A note on the HermiteRankin constant. J. Thorie des Nombres de Bordeaux 22, 209\u2013217 (2010).","journal-title":"J. Thorie des Nombres de Bordeaux"},{"key":"273_CR30","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1017\/S0963548300001371","volume":"3","author":"CP Schnorr","year":"1994","unstructured":"Schnorr C.P.: Block reduced lattice bases and successive minima. Comb. Probab. Comput. 3, 507\u2013533 (1994).","journal-title":"Comb. Probab. Comput."},{"key":"273_CR31","unstructured":"Schnorr C.P.: Accelerated slide- and LLL-reduction, Electronic Colloqiuium on Computational Complexity, Report TR11-050, Frankfurt (2011)."},{"key":"273_CR32","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":"273_CR33","doi-asserted-by":"crossref","unstructured":"Sch\u00f6nhage A.: Factorization of univariate integer polynomials by Diophantine approximation and an improved basis reduction algorithm. In: Automata, Languages and Programming, pp. 436\u2013447. Springer, Berlin (1984).","DOI":"10.1007\/3-540-13345-3_40"},{"key":"273_CR34","first-page":"1","volume-title":"The LLL Algorithm: Survey and Applications","author":"I Smeets","year":"2010","unstructured":"Smeets I.: The history of the LLL algorithm. In: Nguyen P.Q., Vall\u00e9e B. (eds.) The LLL Algorithm: Survey and Applications, pp. 1\u201317. Springer, Berlin (2010)."},{"key":"273_CR35","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1112\/jlms\/jdr032","volume":"84","author":"A S\u00f6dergren","year":"2011","unstructured":"S\u00f6dergren A.: On the distribution of angles between the \n                        $$N$$\n                        \n                            \n                                            \n                                N\n                            \n                        \n                     shortest vectors in a random lattice. J. Lond. Math. Soc. 84, 749\u2013764 (2011).","journal-title":"J. Lond. Math. Soc."},{"key":"273_CR36","unstructured":"Storjohann A.: Faster algorithms for integer lattice basis reduction. Unpublished Manuscript (1996) \n                        e-collection.library.ethz.ch\/eserv\/eth:3342\/eth-3342-01"},{"key":"273_CR37","unstructured":"The FPLLL Development Team, fplll, a lattice reduction library, Software (2016). \n                        https:\/\/github.com\/fplll\/fplll"},{"key":"273_CR38","unstructured":"Vet\u010dinkin N.M.: Uniqueness of the classes of positive quadratic forms on which the values of the Hermite constants are attained for \n                        $$6\\le n\\le 8$$\n                        \n                            \n                                            \n                                \n                                    6\n                                    \u2264\n                                    n\n                                    \u2264\n                                    8\n                                \n                            \n                        \n                    . In: Ry\u0161kov S.S. (ed.) The Geometry of Quadratic Forms. Proceedings of the Steklov Institute of Mathematics, pp. 37\u201396. American Mathematical Society, Providence (1982)."},{"key":"273_CR39","doi-asserted-by":"crossref","unstructured":"Zhao K, Li Y, Jiang H., Du S.: A low complexity fast lattice algorithm for MIMO detection. In: 23rd International Symposium on Personal Indoor and Mobile Radio Communications (PIMRC), pp. 1612\u20131616. IEEE, Piscataway (2012).","DOI":"10.1109\/PIMRC.2012.6362605"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-016-0273-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-016-0273-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-016-0273-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,5,22]],"date-time":"2017-05-22T07:15:33Z","timestamp":1495437333000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-016-0273-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,15]]},"references-count":39,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["273"],"URL":"https:\/\/doi.org\/10.1007\/s10623-016-0273-9","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,9,15]]}}}