{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:26:36Z","timestamp":1743049596709,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642299513"},{"type":"electronic","value":"9783642299520"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29952-0_18","type":"book-chapter","created":{"date-parts":[[2012,5,3]],"date-time":"2012-05-03T06:14:09Z","timestamp":1336025649000},"page":"143-155","source":"Crossref","is-referenced-by-count":4,"title":["Lower Bounds of Shortest Vector Lengths in Random NTRU Lattices"],"prefix":"10.1007","author":[{"given":"Jingguo","family":"Bi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qi","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: The shortest vector problem in l2 is NP-hard for randomized reductions (extended abstract) In: Proc. 30th ACM Symp. on Theory of Computing (STOC), pp. 10\u201319. ACM (1998)","DOI":"10.1145\/276698.276705"},{"key":"18_CR2","unstructured":"Ajtai, M.: Random lattices and a conjectured 0-1 law about their polynomial time computable properties. In: Proc. of FOCS 2002, pp. 13\u201339. IEEE (2002)"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01201999","volume":"2","author":"M.J. Coster","year":"1992","unstructured":"Coster, M.J., Joux, A., La Macchia, B.A., Odlyzko, A.M., Schnorr, C.P., Stern, J.: An improved lowdensity subset sum algorithm. Computational Complexity\u00a02, 111\u2013128 (1992)","journal-title":"Computational Complexity"},{"issue":"2","key":"18_CR4","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1006\/jcss.1999.1649","volume":"59","author":"J.-Y. Cai","year":"1999","unstructured":"Cai, J.-Y., Nerurkar, A.: Approximating the SVP to within a factor (1 + 1\/ dim) is NP-hard under randomized reductions. J. Comput. System Sci.\u00a059(2), 221\u2013239 (1999)","journal-title":"J. Comput. System Sci."},{"key":"18_CR5","unstructured":"Consortium for Efficient Embedded Security. Efficient embedded security standards $\\sharp 1$ : Implementation aspects of NTRUEncrypt and NTRUSign, version (June 2, 2003)"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1007\/3-540-69053-0_5","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"D. Coppersmith","year":"1997","unstructured":"Coppersmith, D., Shamir, A.: Lattice Attacks on NTRU. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 52\u201361. Springer, Heidelberg (1997)"},{"key":"18_CR7","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); First presented at the rump session of Crypto 1996"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Haviv, I., Regev, O.: Tensor-based hardness of the shortest vector problem to within almost polynomial factors. In: Proc. 39th ACM Symp. on Theory of Computing (STOC), pp. 469\u2013477 (2007)","DOI":"10.1145\/1250790.1250859"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-540-30574-3_10","volume-title":"Topics in Cryptology \u2013 CT-RSA 2005","author":"N. Howgrave-Graham","year":"2005","unstructured":"Howgrave-Graham, N., Silverman, J.H., Whyte, W.: Choosing Parameter Sets for NTRUEncrypt with NAEP and SVES-3. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol.\u00a03376, pp. 118\u2013135. Springer, Heidelberg (2005)"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1112\/jlms\/s1-31.4.445","volume":"s1-31","author":"A.W. Ingleton","year":"1956","unstructured":"Ingleton, A.W.: The Rank of Circulant Matrices. J. London Math. Soc.\u00a0s1-31, 445\u2013460 (1956)","journal-title":"J. London Math. Soc."},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Khot, S.: Hardness of approximating the shortest vector problem in lattices. In: Proc. 45th Annual IEEE Symp. on Foundations of Computer Science (FOCS), pp. 126\u2013135 (2004)","DOI":"10.1109\/FOCS.2004.31"},{"key":"18_CR12","series-title":"Encyclopedia of Mathematics and its Applications","volume-title":"Finite fields","author":"R. Lidl","year":"1983","unstructured":"Lidl, R., Niederreiter, H.: Finite fields. Encyclopedia of Mathematics and its Applications, vol.\u00a020. Addison-Wesley, Reading (1983)"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Lagarias, J.C., Odlyzko, A.M.: Solving low-density subset sum problems. Journal of the Association for Computing Machinery (January 1985)","DOI":"10.1145\/2455.2461"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Li, M., Vit\u00e1nyi, P.: An introduction to Kolmogorov complexity and its applications, 2nd edn. Springer (1997)","DOI":"10.1007\/978-1-4757-2606-0"},{"issue":"6","key":"18_CR15","doi-asserted-by":"publisher","first-page":"2008","DOI":"10.1137\/S0097539700373039","volume":"30","author":"D. Micciancio","year":"2001","unstructured":"Micciancio, D.: The shortest vector problem is NP-hard to approximate to within some constant. SIAM J. on Computing\u00a030(6), 2008\u20132035 (2001); Preliminary version in FOCS (1998)","journal-title":"SIAM J. on Computing"},{"key":"18_CR16","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/BF01571276","volume":"110","author":"J.E. Mazo","year":"1990","unstructured":"Mazo, J.E., Odlyzko, A.M.: Lattice points in high-dimensional spheres. Monatsh. Math.\u00a0110, 47\u201361 (1990)","journal-title":"Monatsh. Math."},{"key":"18_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/11792086_18","volume-title":"Algorithmic Number Theory","author":"P.Q. Nguyen","year":"2006","unstructured":"Nguyen, P.Q., Stehl\u00e9, D.: LLL on the Average. In: Hess, F., Pauli, S., Pohst, M. (eds.) ANTS 2006. LNCS, vol.\u00a04076, pp. 238\u2013256. Springer, Heidelberg (2006)"},{"issue":"2","key":"18_CR18","doi-asserted-by":"publisher","first-page":"340","DOI":"10.2307\/1969027","volume":"46","author":"C.L. Siegel","year":"1945","unstructured":"Siegel, C.L.: A mean Value theorem in geometry of numbers. Annals of Mathematics\u00a046(2), 340\u2013347 (1945)","journal-title":"Annals of Mathematics"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29952-0_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:54:23Z","timestamp":1743044063000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29952-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642299513","9783642299520"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29952-0_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}