{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T13:13:39Z","timestamp":1790774019234,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,5,17]],"date-time":"2008-05-17T00:00:00Z","timestamp":1210982400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,5,17]]},"DOI":"10.1145\/1374376.1374408","type":"proceedings-article","created":{"date-parts":[[2008,5,28]],"date-time":"2008-05-28T12:50:20Z","timestamp":1211979020000},"page":"207-216","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":99,"title":["Finding short lattice vectors within mordell's inequality"],"prefix":"10.1145","author":[{"given":"Nicolas","family":"Gama","sequence":"first","affiliation":[{"name":"Ecole normale superieure, INRIA, CNRS, Paris, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Phong Q.","family":"Nguyen","sequence":"additional","affiliation":[{"name":"Ecole normale superieure, CNRS, INRIA, Paris, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2008,5,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780602"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380857"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/206777"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2003.157.689"},{"key":"e_1_3_2_1_5_1","volume-title":"Sphere Packings, Lattices and Groups","author":"Conway J.","year":"1998","unstructured":"J. Conway and N. Sloane . Sphere Packings, Lattices and Groups . Springer-Verlag , 1998 . Third edition.]] J. Conway and N. Sloane. Sphere Packings, Lattices and Groups. Springer-Verlag, 1998. Third edition.]]"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/11818175_7"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/11761679_15"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1788414.1788417"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-97881-4"},{"key":"e_1_3_2_1_10_1","volume-title":"North-Holland","author":"Gruber M.","year":"1987","unstructured":"M. Gruber and C. G. Lekkerkerker . Geometry of Numbers . North-Holland , 1987 .]] M. Gruber and C. G. Lekkerkerker. Geometry of Numbers. North-Holland, 1987.]]"},{"key":"e_1_3_2_1_11_1","volume-title":"Worst-case Hermite-Korkine-Zolotarev reduced lattice bases. CoRR, abs\/0801.3331","author":"Hanrot G.","year":"2008","unstructured":"G. Hanrot and D. Stehle . Worst-case Hermite-Korkine-Zolotarev reduced lattice bases. CoRR, abs\/0801.3331 , 2008 .]] G. Hanrot and D. Stehle. Worst-case Hermite-Korkine-Zolotarev reduced lattice bases. CoRR, abs\/0801.3331, 2008.]]"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1515\/crll.1850.40.279"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/800061.808749"},{"key":"e_1_3_2_1_14_1","volume-title":"Inapproximability results for computational problems on lattices","author":"Khot S.","year":"2007","unstructured":"S. Khot . Inapproximability results for computational problems on lattices . 2007 . To appear in NgVa 07.]] S. Khot. Inapproximability results for computational problems on lattices. 2007. To appear in NgVa07.]]"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01442795"},{"key":"e_1_3_2_1_16_1","unstructured":"J. L. Lagrange. Recherches d'arithmetique. Nouveaux Memoires de l'Academie de Berlin 1773.]]  J. L. Lagrange. Recherches d'arithmetique. Nouveaux Memoires de l'Academie de Berlin 1773.]]"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01457454"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970203"},{"key":"e_1_3_2_1_19_1","unstructured":"CBMS-NSF Regional Conference Series in Applied Mathematics.]]  CBMS-NSF Regional Conference Series in Applied Mathematics.]]"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-05167-2"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/560443"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-88330-9"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/19.73_Part_1.3"},{"key":"e_1_3_2_1_24_1","series-title":"LNCS","volume-title":"Proc. of CALC '01","author":"Nguyen P. Q.","year":"2001","unstructured":"P. Q. Nguyen and J. Stern . The two faces of lattices in cryptology . In Proc. of CALC '01 , volume 2146 of LNCS . Springer-Verlag , 2001 .]] P. Q. Nguyen and J. Stern. The two faces of lattices in cryptology. In Proc. of CALC '01, volume 2146 of LNCS. Springer-Verlag, 2001.]]"},{"key":"e_1_3_2_1_25_1","volume-title":"LLL+25. Information Security and Cryptography","author":"Nguyen P. Q.","year":"2008","unstructured":"P. Q. Nguyen and B. Vallee , editors . LLL+25. Information Security and Cryptography . Springer , 2008 . To appear.]] P. Q. Nguyen and B. Vallee, editors. LLL+25. Information Security and Cryptography. Springer, 2008. To appear.]]"},{"key":"e_1_3_2_1_26_1","volume-title":"Sieve algorithms for the shortest vector problem are practical. J. of Mathematical Cryptology","author":"Nguyen P. Q.","year":"2008","unstructured":"P. Q. Nguyen and T. Vidick . Sieve algorithms for the shortest vector problem are practical. J. of Mathematical Cryptology , 2008 . To appear.]] P. Q. Nguyen and T. Vidick. Sieve algorithms for the shortest vector problem are practical. J. of Mathematical Cryptology, 2008. To appear.]]"},{"key":"e_1_3_2_1_27_1","volume-title":"On the complexity of lattice problems with polynomial approximation factors","author":"Regev O.","year":"2007","unstructured":"O. Regev . On the complexity of lattice problems with polynomial approximation factors . 2007 . To appear in NgVa 07.]] O. Regev. On the complexity of lattice problems with polynomial approximation factors. 2007. To appear in NgVa07.]]"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/2796561.2796598"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01581144"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/143242.143327"}],"event":{"name":"STOC '08: Symposium on Theory of Computing","location":"Victoria British Columbia Canada","acronym":"STOC '08","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the fortieth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1374376.1374408","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1374376.1374408","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:22:32Z","timestamp":1750263752000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1374376.1374408"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,5,17]]},"references-count":30,"alternative-id":["10.1145\/1374376.1374408","10.1145\/1374376"],"URL":"https:\/\/doi.org\/10.1145\/1374376.1374408","relation":{},"subject":[],"published":{"date-parts":[[2008,5,17]]},"assertion":[{"value":"2008-05-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}