{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,22]],"date-time":"2026-10-22T00:13:37Z","timestamp":1792628017220,"version":"4.5.0"},"publisher-location":"Berlin, Heidelberg","reference-count":39,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540789666","type":"print"},{"value":"9783540789673","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78967-3_3","type":"book-chapter","created":{"date-parts":[[2008,4,4]],"date-time":"2008-04-04T00:11:30Z","timestamp":1207267890000},"page":"31-51","source":"Crossref","is-referenced-by-count":267,"title":["Predicting Lattice Reduction"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Gama","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Phong Q.","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"Ajtai, M.: Generating random lattices according to the invariant distribution (Draft of March 2006)"},{"key":"3_CR2","first-page":"99","volume-title":"Proc. of 28th STOC","author":"M. Ajtai","year":"1996","unstructured":"Ajtai, M.: Generating hard instances of lattice problems. In: Proc. of 28th STOC, pp. 99\u2013108. ACM Press, New York (1996)"},{"key":"3_CR3","first-page":"284","volume-title":"Proc. of 29th STOC","author":"M. Ajtai","year":"1997","unstructured":"Ajtai, M., Dwork, C.: A public-key cryptosystem with worst-case\/average-case equivalence. In: Proc. of 29th STOC, pp. 284\u2013293. ACM Press, New York (1997)"},{"key":"3_CR4","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)"},{"key":"3_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)"},{"issue":"2","key":"3_CR6","doi-asserted-by":"publisher","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. of Math (2)\u00a0157(2), 689\u2013714 (2003)","journal-title":"I. Ann. of Math (2)"},{"issue":"4","key":"3_CR7","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); Revised version of two articles from Eurocrypt 1996","journal-title":"J. of Cryptology"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/11818175_7","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"N. Gama","year":"2006","unstructured":"Gama, N., Howgrave-Graham, N., Koy, H., Nguyen, P.Q.: Rankin\u2019s constant and blockwise lattice reduction. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 112\u2013130. Springer, Heidelberg (2006)"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/11761679_15","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"N. Gama","year":"2006","unstructured":"Gama, N., Howgrave-Graham, N., Nguyen, P.Q.: Symplectic Lattice Reduction and NTRU. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 233\u2013253. Springer, Heidelberg (2006)"},{"key":"3_CR10","volume-title":"STOC 2008: Proc. of the 40th Annual ACM Symposium on Theory of Computing","author":"N. Gama","year":"2008","unstructured":"Gama, N., Nguyen, P.Q.: Finding short lattice vectors within Mordell\u2019s inequality. In: STOC 2008: Proc. of the 40th Annual ACM Symposium on Theory of Computing, ACM Press, New York (2008)"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. Cryptology ePrint Archive, Report 2007\/432 (2007) (to appear in STOC 2008), http:\/\/eprint.iacr.org\/","DOI":"10.1145\/1374376.1374407"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/BFb0052231","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"O. Goldreich","year":"1997","unstructured":"Goldreich, O., Goldwasser, S., Halevi, S.: Public-key cryptosystems from lattice reduction problems. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 112\u2013131. Springer, Heidelberg (1997)"},{"issue":"2","key":"3_CR13","doi-asserted-by":"publisher","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 Math\u00a015(2), 165\u2013189 (2003)","journal-title":"Forum Math"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-540-71677-8_8","volume-title":"Public Key Cryptography \u2013 PKC 2007","author":"D. Han","year":"2007","unstructured":"Han, D., Kim, M.-H., Yeom, Y.: Cryptanalysis of the Paeng-Jung-Ha cryptosystem from PKC 2003. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol.\u00a04450, pp. 107\u2013117. Springer, Heidelberg (2007)"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BFb0054868","volume-title":"Algorithmic Number Theory","author":"J. Hoffstein","year":"1998","unstructured":"Hoffstein, J., Pipher, J., Silverman, J.: NTRU: a ring based public key cryptosystem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol.\u00a01423, pp. 267\u2013288. Springer, Heidelberg (1998)"},{"issue":"3","key":"3_CR16","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":"3_CR17","first-page":"193","volume-title":"Proc. of 15th STOC","author":"R. Kannan","year":"1983","unstructured":"Kannan, R.: Improved algorithms for integer programming and related lattice problems. In: Proc. of 15th STOC, pp. 193\u2013206. ACM Press, New York (1983)"},{"key":"3_CR18","unstructured":"Klein, P.: Finding the closest lattice vector when it\u2019s unusually close. In: Proc. of SODA 2000, ACM\u2013SIAM (2000)"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Lagarias, J.C., Odlyzko, A.M.: Solving low-density subset sum problems. In: Journal of the Association for Computing Machinery (January 1985)","DOI":"10.1145\/2455.2461"},{"key":"3_CR20","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":"3_CR21","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":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44670-2_10","volume-title":"Cryptography and Lattices","author":"A. May","year":"2001","unstructured":"May, A., Silverman, J.H.: Dimension reduction methods for convolution modular lattices. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol.\u00a02146, Springer, Heidelberg (2001)"},{"key":"3_CR23","volume-title":"The Kluwer International Series in Engineering and Computer Science","author":"D. Micciancio","year":"2002","unstructured":"Micciancio, D., Goldwasser, S.: Complexity of lattice problems: A cryptographic perspective. In: The Kluwer International Series in Engineering and Computer Science, vol.\u00a0671, Kluwer Academic Publishers, Boston (2002)"},{"issue":"1","key":"3_CR24","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1137\/S0097539705447360","volume":"37","author":"D. Micciancio","year":"2007","unstructured":"Micciancio, D., Regev, O.: Worst-case to average-case reductions based on Gaussian measures. SIAM J. Comput.\u00a037(1), 267\u2013302 (2007) (electronic)","journal-title":"SIAM J. Comput."},{"key":"3_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1007\/3-540-48405-1_18","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"P.Q. Nguyen","year":"1999","unstructured":"Nguyen, P.Q.: Cryptanalysis of the Goldreich-Goldwasser-Halevi cryptosystem from Crypto 1997. In: Wiener, M.J. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 288\u2013304. Springer, Heidelberg (1999)"},{"issue":"3","key":"3_CR26","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":"3_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/11426639_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"P.Q. Nguyen","year":"2005","unstructured":"Nguyen, P.Q., Stehl\u00e9, D.: Floating-Point LLL Revisited. In: Cramer, R.J.F. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 215\u2013233. Springer, Heidelberg (2005)"},{"key":"3_CR28","doi-asserted-by":"crossref","unstructured":"Nguyen, P.Q., Stehl\u00e9, D.: LLL on the average. In: ANTS, pp. 238\u2013256 (2006)","DOI":"10.1007\/11792086_18"},{"key":"3_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44670-2_12","volume-title":"Cryptography and Lattices","author":"P.Q. Nguyen","year":"2001","unstructured":"Nguyen, P.Q., Stern, J.: The two faces of lattices in cryptology. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol.\u00a02146, Springer, Heidelberg (2001)"},{"key":"3_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/11593447_3","volume-title":"Advances in Cryptology - ASIACRYPT 2005","author":"P.Q. Nguyen","year":"2005","unstructured":"Nguyen, P.Q., Stern, J.: Adapting density attacks to low-weight knapsacks. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol.\u00a03788, pp. 41\u201358. Springer, Heidelberg (2005)"},{"key":"3_CR31","doi-asserted-by":"crossref","unstructured":"Nguyen, P.Q., Vidick, T.: Sieve algorithms for the shortest vector problem are practical. J. of Mathematical Cryptology (to appear, 2008)","DOI":"10.1515\/JMC.2008.009"},{"key":"3_CR32","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. American Mathematical Society (1989)","DOI":"10.1090\/psapm\/042\/1095552"},{"key":"3_CR33","doi-asserted-by":"crossref","unstructured":"Peikert, C., Waters, B.: Lossy trapdoor functions and their applications. Cryptology ePrint Archive, Report 2007\/279 (2007) to appear in STOC 2008 http:\/\/eprint.iacr.org\/","DOI":"10.1145\/1374376.1374406"},{"issue":"6","key":"3_CR34","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1145\/1039488.1039490","volume":"51","author":"O. Regev","year":"2004","unstructured":"Regev, O.: New lattice-based cryptographic constructions. J. ACM\u00a051(6), 899\u2013942 (2004)","journal-title":"J. ACM"},{"key":"3_CR35","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/1060590.1060603","volume-title":"STOC 2005: Proceedings of the 37th Annual ACM Symposium on Theory of Computing","author":"O. Regev","year":"2005","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: STOC 2005: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, pp. 84\u201393. ACM Press, New York (2005)"},{"key":"3_CR36","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"},{"key":"3_CR37","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":"3_CR38","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)"},{"key":"3_CR39","unstructured":"Shoup, V.: Number Theory C++ Library (NTL) version 5.4.1, http:\/\/www.shoup.net\/ntl\/"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78967-3_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:05:50Z","timestamp":1619507150000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78967-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540789666","9783540789673"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78967-3_3","relation":{},"subject":[]}}