{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T05:31:16Z","timestamp":1740547876706,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212362"},{"type":"electronic","value":"9783540247494"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24749-4_33","type":"book-chapter","created":{"date-parts":[[2010,9,8]],"date-time":"2010-09-08T19:01:54Z","timestamp":1283972514000},"page":"370-381","source":"Crossref","is-referenced-by-count":1,"title":["Lattices with Many Cycles Are Dense"],"prefix":"10.1007","author":[{"given":"M\u00e5rten","family":"Trolin","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"33_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Generating Hard Instances of Lattice Problems. In: Proc. 28th ACM Symposium on Theory of Computing, pp. 99\u2013108 (1996)","DOI":"10.1145\/237814.237838"},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: The shortest vector problem in I 2 is NP-hard for randomized reductions. In: Proc. 30th ACM Symposium on the Theory of Computing, pp. 10\u201319 (1998)","DOI":"10.1145\/276698.276705"},{"key":"33_CR3","unstructured":"Cai, J.-Y., Nerurkar, A.: An Improved Worst-Case to Average-Case Connection for Lattice Problems. In: Proc. 38th IEEE Symposium on Foundations of Computer Science, pp. 468\u2013477 (1997)"},{"key":"33_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/3-540-46521-9_22","volume-title":"Algorithms and Complexity","author":"I. Dinur","year":"2000","unstructured":"Dinur, I.: Approximating SVP\u221e to within almost polynomial factors is NP-hard. CIAC 2000. In: Bongiovanni, G., Petreschi, R., Gambosi, G. (eds.) CIAC 2000. LNCS, vol.\u00a01767, pp. 263\u2013276. Springer, Heidelberg (2000)"},{"issue":"3","key":"33_CR5","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1006\/jcss.1999.1686","volume":"60","author":"O. Goldreich","year":"2000","unstructured":"Goldreich, O., Goldwasser, S.: On the limits of non-approximability of lattice problems. Journal of Computer and System Sciences\u00a060(3), 540\u2013563 (2000), Can be obtained from http:\/\/www.eccc.uni-trier.de\/eccc","journal-title":"Journal of Computer and System Sciences"},{"key":"33_CR6","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.H.: NTRU: a ring based public key cryptosystem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol.\u00a01423, pp. 267\u2013288. Springer, Heidelberg (1998)"},{"key":"33_CR7","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1137\/0208040","volume":"8","author":"R. Kannan","year":"1979","unstructured":"Kannan, R., Bachem, A.: Polynomial Algorithms for Computing of the Smith and Hermite Normal Forms of an Integer Matrix. SIAM Journal of Computing\u00a08, 499\u2013507 (1979)","journal-title":"SIAM Journal of Computing"},{"key":"33_CR8","doi-asserted-by":"crossref","unstructured":"Khot, S.: Hardness of Approximating the Shortest Vector Problem in High Lp Norms. In: Proc. 44th IEEE Symposium on Foundations of Computer Science, pp. 290\u2013297 (2003)","DOI":"10.1109\/SFCS.2003.1238203"},{"key":"33_CR9","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1137\/0214016","volume":"14","author":"J.C. Lagarias","year":"1985","unstructured":"Lagarias, J.C.: The Computational Complexity of Simultaneous Diophantine Approximation Problems. SIAM Journal of Computing\u00a014, 196\u2013209 (1985)","journal-title":"SIAM Journal of Computing"},{"key":"33_CR10","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A.K. Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra, H.W., Lov\u00e1sz, L.: Factoring Polynomials with Rational Coefficients. Mathematische Annalen\u00a0261, 515\u2013534 (1982)","journal-title":"Mathematische Annalen"},{"key":"33_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/3-540-44670-2_11","volume-title":"Cryptography and Lattices","author":"D. Micciancio","year":"2001","unstructured":"Micciancio, D.: Improving Lattice Based Cryptosystems Using the Hermite Normal Form. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol.\u00a02146, pp. 126\u2013145. Springer, Heidelberg (2001)"},{"key":"33_CR12","doi-asserted-by":"publisher","first-page":"2008","DOI":"10.1137\/S0097539700373039","volume":"30","author":"D. Micciancio","year":"2001","unstructured":"Micciancio, D.: The Shortest Vector in a Lattice is Hard to Approximate within Some Constant. SIAM Journal of Computing\u00a030, 2008\u20132035 (2001)","journal-title":"SIAM Journal of Computing"},{"key":"33_CR13","doi-asserted-by":"crossref","unstructured":"Paz, A., Schnorr, C.P.: Approximating Integer Lattices by Lattices with Cyclic Lattice Groups. Automata, languages and programming (Karlsruhe), pp. 386\u2013393 (1987)","DOI":"10.1007\/3-540-18088-5_33"},{"key":"33_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/3-540-44670-2_14","volume-title":"Cryptography and Lattices","author":"M. Trolin","year":"2001","unstructured":"Trolin, M.: The Shortest Vector Problem in Lattices with Many Cycles. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol.\u00a02146, pp. 194\u2013205. Springer, Heidelberg (2001)"},{"key":"33_CR15","unstructured":"Trolin, M.: Lattices with Many Cycles are Dense (full version), Can be obtained from http:\/\/www.nada.kth.se\/~marten"},{"key":"33_CR16","unstructured":"van Emde Boas, P.: Another NP-complete partition problem and the complexity of computing short vectors in lattices. Technical Report 81-04. Mathematics Department, University of Amsterdam (1981), Can be obtained from http:\/\/turing.wins.uva.nl\/~peter"}],"container-title":["Lecture Notes in Computer Science","STACS 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24749-4_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T17:08:36Z","timestamp":1740503316000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24749-4_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212362","9783540247494"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24749-4_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}