{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T13:28:16Z","timestamp":1776864496875,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540374329","type":"print"},{"value":"9783540374336","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11818175_7","type":"book-chapter","created":{"date-parts":[[2006,9,23]],"date-time":"2006-09-23T06:21:52Z","timestamp":1158992512000},"page":"112-130","source":"Crossref","is-referenced-by-count":40,"title":["Rankin\u2019s Constant and Blockwise Lattice Reduction"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Gama","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nick","family":"Howgrave-Graham","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Henrik","family":"Koy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Phong Q.","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1145\/780542.780602","volume-title":"Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing (electronic)","author":"M. Ajtai","year":"2003","unstructured":"Ajtai, M.: The worst-case behavior of Schnorr\u2019s algorithm approximating the shortest nonzero vector in a lattice. In: Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing (electronic), pp. 396\u2013406. ACM Press, New York (2003)"},{"key":"7_CR2","first-page":"601","volume-title":"Proc. 33rd STOC","author":"M. Ajtai","year":"2001","unstructured":"Ajtai, M., Kumar, R., Sivakumar, D.: A sieve algorithm for the shortest lattice vector problem. In: Proc. 33rd STOC, pp. 601\u2013610. ACM Press, New York (2001)"},{"issue":"1-2","key":"7_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0166-218X(00)00341-3","volume":"111","author":"M.I. Boguslavsky","year":"2001","unstructured":"Boguslavsky, M.I.: Radon transforms and packings. Discrete Appl. Math.\u00a0111(1-2), 3\u201322 (2001)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"7_CR4","first-page":"203","volume":"46","author":"D. Boneh","year":"1999","unstructured":"Boneh, D.: Twenty years of attacks on the RSA cryptosystem. Notices of the AMS\u00a046(2), 203\u2013213 (1999)","journal-title":"Notices of the AMS"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"D. Boneh","year":"1999","unstructured":"Boneh, D., Durfee, G.: Cryptanalysis of RSA with private key d less than N 0.292. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 1\u201311. Springer, Heidelberg (1999)"},{"key":"7_CR6","series-title":"London Mathematical Society Monographs","volume-title":"Rational quadratic forms","author":"J.W.S. Cassels","year":"1978","unstructured":"Cassels, J.W.S.: Rational quadratic forms. London Mathematical Society Monographs, vol.\u00a013. Academic Press Inc. [Harcourt Brace Jovanovich Publishers], London (1978)"},{"key":"7_CR7","volume-title":"A Course in Computational Algebraic Number Theory","author":"H. Cohen","year":"1995","unstructured":"Cohen, H.: A Course in Computational Algebraic Number Theory, 2nd edn. Springer, Heidelberg (1995)","edition":"2"},{"key":"7_CR8","volume-title":"Sphere Packings, Lattices and Groups","author":"J. Conway","year":"1998","unstructured":"Conway, J., Sloane, N.: Sphere Packings, Lattices and Groups, 3rd edn. Springer, Heidelberg (1998)","edition":"3"},{"issue":"4","key":"7_CR9","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s001459900030","volume":"10","author":"D. Coppersmith","year":"1997","unstructured":"Coppersmith, D.: Small solutions to polynomial equations, and low exponent RSA vulnerabilities. J. of Cryptology\u00a010(4), 233\u2013260 (1997)","journal-title":"J. of Cryptology"},{"key":"7_CR10","volume-title":"Algorithms and Combinatorics: Study and Research Texts","author":"M. Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric algorithms and combinatorial optimization. In: Algorithms and Combinatorics: Study and Research Texts, vol.\u00a02. Springer, Berlin (1988)"},{"key":"7_CR11","doi-asserted-by":"publisher","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. Hermite \u00e0 M. Jacobi sur diff\u00e9rents objets de la th\u00e9orie des nombres, deuxi\u00e8me lettre. J. Reine Angew. Math.\u00a040, 279\u2013290 (1850) (Also available in the first volume of Hermite\u2019s complete works, published by Gauthier-Villars)","journal-title":"J. Reine Angew. Math."},{"issue":"3","key":"7_CR12","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1023\/A:1011214926272","volume":"23","author":"N.A. Howgrave-Graham","year":"2001","unstructured":"Howgrave-Graham, N.A., Smart, N.P.: Lattice attacks on digital signature schemes. Des. Codes Cryptogr.\u00a023(3), 283\u2013290 (2001)","journal-title":"Des. Codes Cryptogr."},{"key":"7_CR13","unstructured":"Lagrange, J.L.: Recherches d\u2019arithm\u00e9tique, Nouveaux M\u00e9moires de l\u2019Acad\u00e9mie de, Berlin, vol.\u00a01773"},{"key":"7_CR14","first-page":"513","volume":"261","author":"A.K. Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra Jr., H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Mathematische Ann.\u00a0261, 513\u2013534 (1982)","journal-title":"Mathematische Ann."},{"key":"7_CR15","series-title":"CBMS-NSF Regional Conference Series in Applied Mathematics","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970203","volume-title":"An Algorithmic Theory of Numbers, Graphs and Convexity","author":"L. Lov\u00e1sz","year":"1986","unstructured":"Lov\u00e1sz, L.: An Algorithmic Theory of Numbers, Graphs and Convexity. CBMS-NSF Regional Conference Series in Applied Mathematics, vol.\u00a050. SIAM Publications, Philadelphia (1986)"},{"key":"7_CR16","unstructured":"Martinet, J.: Les r\u00e9seaux parfaits des espaces euclidiens. Masson, Paris (1996)"},{"key":"7_CR17","series-title":"The Kluwer International Series in Engineering and Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-0897-7","volume-title":"Complexity of lattice problems","author":"D. Micciancio","year":"2002","unstructured":"Micciancio, D., Goldwasser, S.: Complexity of lattice problems. The Kluwer International Series in Engineering and Computer Science, vol.\u00a0671. Kluwer Academic Publishers, Boston (2002) (A cryptographic perspective)"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Milnor, J., Husemoller, D.: Symmetric bilinear forms. Math. Z (1973)","DOI":"10.1007\/978-3-642-88330-9"},{"issue":"3","key":"7_CR19","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s00145-002-0021-3","volume":"15","author":"P.Q. Nguyen","year":"2002","unstructured":"Nguyen, P.Q., Shparlinski, I.E.: The insecurity of the digital signature algorithm with partially known nonces. J. Cryptology\u00a015(3), 151\u2013176 (2002)","journal-title":"J. Cryptology"},{"key":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/11426639_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"P.Q. Ngu\u00ean","year":"2005","unstructured":"Ngu\u00ean, P.Q., Stehl\u00e9, D.: Floating-point LLL revisited. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 215\u2013233. Springer, Heidelberg (2005)"},{"key":"7_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/3-540-44670-2_12","volume-title":"Cryptography and Lattices","author":"P.Q. Nguy\u00ean","year":"2001","unstructured":"Nguy\u00ean, P.Q., Stern, J.: The two faces of lattices in cryptology. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol.\u00a02146, p. 146. Springer, Heidelberg (2001)"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Odlyzko, A.M.: The rise and fall of knapsack cryptosystems. In: Proc. of Cryptology and Computational Number Theory. Proc. of Symposia in Applied Mathematics, vol.\u00a042, pp. 75\u201388. AMA (1989)","DOI":"10.1090\/psapm\/042\/1095552"},{"key":"7_CR23","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1112\/jlms\/s1-28.3.309","volume":"28","author":"R.A. Rankin","year":"1953","unstructured":"Rankin, R.A.: On positive definite quadratic forms. J. London Math. Soc.\u00a028, 309\u2013314 (1953)","journal-title":"J. London Math. Soc."},{"key":"7_CR24","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0304-3975(87)90064-8","volume":"53","author":"C.P. Schnorr","year":"1987","unstructured":"Schnorr, C.P.: A hierarchy of polynomial lattice basis reduction algorithms. Theoretical Computer Science\u00a053, 201\u2013224 (1987)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"7_CR25","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0196-6774(88)90004-1","volume":"9","author":"C.P. Schnorr","year":"1988","unstructured":"Schnorr, C.P.: A more efficient algorithm for lattice basis reduction. J. of algorithms\u00a09(1), 47\u201362 (1988)","journal-title":"J. of algorithms"},{"key":"7_CR26","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01581144","volume":"66","author":"C.P. Schnorr","year":"1994","unstructured":"Schnorr, C.P., Euchner, M.: Lattice basis reduction: improved practical algorithms and solving subset sum problems. Math. Programming\u00a066, 181\u2013199 (1994)","journal-title":"Math. Programming"},{"key":"7_CR27","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Advances in Cryptology - EUROCRYPT \u201995","author":"C.-P. Schnorr","year":"1995","unstructured":"Schnorr, C.-P., H\u00f6rner, H.H.: Attacking the chor-rivest cryptosystem by improved lattice reduction. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol.\u00a0921, pp. 1\u201312. Springer, Heidelberg (1995)"},{"issue":"2","key":"7_CR28","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1307\/mmj\/1030132184","volume":"45","author":"J.L. Thunder","year":"1998","unstructured":"Thunder, J.L.: Higher-dimensional analogs of Hermite\u2019s constant. Michigan Math. J.\u00a045(2), 301\u2013314 (1998)","journal-title":"Michigan Math. J."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - CRYPTO 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11818175_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:16:16Z","timestamp":1605644176000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11818175_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540374329","9783540374336"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/11818175_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}