{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T07:45:07Z","timestamp":1776843907929,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642145179","type":"print"},{"value":"9783642145186","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14518-6_15","type":"book-chapter","created":{"date-parts":[[2010,7,8]],"date-time":"2010-07-08T06:45:55Z","timestamp":1278571555000},"page":"157-173","source":"Crossref","is-referenced-by-count":21,"title":["Short Bases of Lattices over Number Fields"],"prefix":"10.1007","author":[{"given":"Claus","family":"Fieker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Damien","family":"Stehl\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","first-page":"601","volume-title":"Proc. STOC 2001","author":"M. Ajtai","year":"2001","unstructured":"Ajtai, M., Kumar, R., Sivakumar, D.: A sieve algorithm for the shortest lattice vector problem. In: Proc. STOC 2001, pp. 601\u2013610. ACM, New York (2001)"},{"key":"15_CR2","doi-asserted-by":"crossref","first-page":"19","DOI":"10.5802\/jtnb.433","volume":"16","author":"K. Belabas","year":"2004","unstructured":"Belabas, K.: Topics in computational algebraic number theory. J. th\u00e9orie des nombres de Bordeaux\u00a016, 19\u201363 (2004)","journal-title":"J. th\u00e9orie des nombres de Bordeaux"},{"issue":"3-4","key":"15_CR3","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W. Bosma","year":"1997","unstructured":"Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system. I. The user language. J. Symbolic Comput.\u00a024(3-4), 235\u2013265 (1997)","journal-title":"J. Symbolic Comput."},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1145\/120694.120714","volume-title":"Proc. ISSAC 1991","author":"W. Bosma","year":"1991","unstructured":"Bosma, W., Pohst, M.: Computations with finitely generated modules over Dedekind domains. In: Proc. ISSAC 1991, pp. 151\u2013156. ACM, New York (1991)"},{"key":"15_CR5","volume-title":"A Course in Computational Algebraic Number Theory","author":"H. Cohen","year":"1995","unstructured":"Cohen, H.: A Course in Computational Algebraic Number Theory. Springer, Heidelberg (1995)"},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"1681","DOI":"10.1090\/S0025-5718-96-00766-1","volume":"65","author":"H. Cohen","year":"1996","unstructured":"Cohen, H.: Hermite and Smith normal form algorithms over Dedekind domains. Math. Comp.\u00a065, 1681\u20131699 (1996)","journal-title":"Math. Comp."},{"key":"15_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8489-0","volume-title":"Advanced topics in Computational Number Theory","author":"H. Cohen","year":"2000","unstructured":"Cohen, H.: Advanced topics in Computational Number Theory. Springer, Heidelberg (2000)"},{"issue":"3","key":"15_CR8","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0019-3577(92)90003-4","volume":"2","author":"J.-H. Evertse","year":"1992","unstructured":"Evertse, J.-H.: Reduced bases of lattices over number fields. Indag. Mathem. N.S.\u00a02(3), 153\u2013168 (1992)","journal-title":"Indag. Mathem. N.S."},{"issue":"322","key":"15_CR9","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1016\/j.jalgebra.2009.05.009","volume":"3","author":"C. Fieker","year":"2009","unstructured":"Fieker, C.: Minimizing representations over number fields II: Computations in the Brauer group. J. Algebra\u00a03(322), 752\u2013765 (2009)","journal-title":"J. Algebra"},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","first-page":"147","volume-title":"Algorithmic Number Theory","author":"C. Fieker","year":"1996","unstructured":"Fieker, C., Pohst, M.E.: Lattices over number fields. In: Cohen, H. (ed.) ANTS 1996. LNCS, vol.\u00a01122, pp. 147\u2013157. Springer, Heidelberg (1996)"},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"2701","DOI":"10.1109\/TSP.2009.2016267","volume":"57","author":"Y.H. Gan","year":"2009","unstructured":"Gan, Y.H., Ling, C., Mow, W.H.: Complex lattice reduction algorithm for low-complexity full-diversity MIMO detection. IEEE Trans. Signal Processing\u00a057, 2701\u20132710 (2009)","journal-title":"IEEE Trans. Signal Processing"},{"key":"15_CR12","unstructured":"Hoppe, A.: Normal forms over Dedekind domains, efficient implementation in the computer algebra system KANT. PhD thesis, Technical University of Berlin (1998)"},{"issue":"4","key":"15_CR13","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 the Smith and Hermite normal forms of an integer matrix. SIAM J. Comput.\u00a08(4), 499\u2013507 (1979)","journal-title":"SIAM J. Comput."},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/BF02128669","volume":"10","author":"J.C. Lagarias","year":"1990","unstructured":"Lagarias, J.C., Lenstra Jr., H.W., Schnorr, C.P.: Korkine-Zolotarev bases and successive minima of a lattice and its reciprocal lattice. Combinatorica\u00a010, 333\u2013348 (1990)","journal-title":"Combinatorica"},{"key":"15_CR15","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A.K. Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra Jr., H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Math. Ann.\u00a0261, 515\u2013534 (1982)","journal-title":"Math. Ann."},{"key":"15_CR16","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. SIAM, Philadelphia (1986)"},{"key":"15_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/11787006_13","volume-title":"Automata, Languages and Programming","author":"V. Lyubashevsky","year":"2006","unstructured":"Lyubashevsky, V., Micciancio, D.: Generalized compact knapsacks are collision resistant. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04052, pp. 144\u2013155. Springer, Heidelberg (2006)"},{"key":"15_CR18","unstructured":"Magma. The Magma computational algebra system for algebra, number theory and geometry, \n                      http:\/\/magma.maths.usyd.edu.au\/magma\/"},{"issue":"4","key":"15_CR19","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s00037-007-0234-9","volume":"16","author":"D. Micciancio","year":"2007","unstructured":"Micciancio, D.: Generalized compact knapsacks, cyclic lattices, and efficient one-way functions. Comput. Complexity\u00a016(4), 365\u2013411 (2007)","journal-title":"Comput. Complexity"},{"key":"15_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-0897-7","volume-title":"Complexity of lattice problems: a cryptographic perspective","author":"D. Micciancio","year":"2002","unstructured":"Micciancio, D., Goldwasser, S.: Complexity of lattice problems: a cryptographic perspective. Kluwer Academic Press, Dordrecht (2002)"},{"key":"15_CR21","unstructured":"Mollin, R.A.: Algebraic Number Theory. Chapman and Hall\/CRC Press (1999)"},{"key":"15_CR22","doi-asserted-by":"crossref","first-page":"387","DOI":"10.5802\/jtnb.176","volume":"2","author":"H. Napias","year":"1996","unstructured":"Napias, H.: A generalization of the LLL-algorithm over Euclidean rings or orders. J. th\u00e9orie des nombres de Bordeaux\u00a02, 387\u2013396 (1996)","journal-title":"J. th\u00e9orie des nombres de Bordeaux"},{"key":"15_CR23","volume-title":"Grundlehren der Mathematischen Wissenschaften","author":"O.T. O\u2019Meara","year":"1963","unstructured":"O\u2019Meara, O.T.: Introduction to Quadratic Forms. In: Grundlehren der Mathematischen Wissenschaften, vol.\u00a0117. Springer, Heidelberg (1963)"},{"key":"15_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/11681878_8","volume-title":"Theory of Cryptography","author":"C. Peikert","year":"2006","unstructured":"Peikert, C., Rosen, A.: Efficient collision-resistant hashing from worst-case assumptions on cyclic lattices. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol.\u00a03876, pp. 145\u2013166. Springer, Heidelberg (2006)"},{"key":"15_CR25","first-page":"478","volume-title":"Proc. STOC 2007","author":"C. Peikert","year":"2007","unstructured":"Peikert, C., Rosen, A.: Lattices that admit logarithmic worst-case to average-case connection factors. In: Proc. STOC 2007, pp. 478\u2013487. ACM, New York (2007)"},{"key":"15_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/978-3-642-10366-7_36","volume-title":"Proc. Asiacrypt 2009","author":"D. Stehl\u00e9","year":"2009","unstructured":"Stehl\u00e9, D., Steinfeld, R., Tanaka, K., Xagawa, K.: Efficient public key encryption based on ideal lattices. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol.\u00a05912, pp. 617\u2013635. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Number Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14518-6_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T22:07:02Z","timestamp":1676066822000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-14518-6_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642145179","9783642145186"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14518-6_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}