{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:53:43Z","timestamp":1764996823547,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540668879"},{"type":"electronic","value":"9783540466659"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46665-7_29","type":"book-chapter","created":{"date-parts":[[2007,9,25]],"date-time":"2007-09-25T01:23:44Z","timestamp":1190683424000},"page":"244-257","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Tensor-Based Trapdoors for CVP and Their Application to Public Key Cryptography (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Roger","family":"Fischlin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Pierre","family":"Seifert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,11,19]]},"reference":[{"key":"29_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02579403","volume":"6","author":"L. Babai","year":"1986","unstructured":"L. Babai: On Lov\u00e1sz\u2019 Lattice Reduction and the Nearest Lattice Point Problem, Combinatorica, vol. 6, pp. 1\u201313, 1986.","journal-title":"Combinatorica"},{"key":"29_CR2","series-title":"Lect Notes Comput Sci","first-page":"187","volume-title":"Asiacrypt\u2019 98","author":"A. Canteaut","year":"1998","unstructured":"A. Canteaut and N. Sendrier: Cryptanalysis of the Original McEliece Cryptosystem, Asiacrypt\u2019 98, LNCS #1541, pp. 187\u2013199, 1998."},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"J.W.S. Cassels: An Introduction to the Geometry of Numbers, Springer Verlag, 1997.","DOI":"10.1007\/978-3-642-62035-5_3"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"H. Cohen: A Course in Computational Algebraic Number Theory, Graduate Texts in Mathematics, vol. 138, Springer Verlag, 1993.","DOI":"10.1007\/978-3-662-02945-9"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"J.H. Conway and N.J. Sloane: Sphere Packings, Lattices and Groups, Springer Verlag, 1988.","DOI":"10.1007\/978-1-4757-2016-7"},{"issue":"1","key":"29_CR6","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1287\/moor.12.1.50","volume":"12","author":"P.D. Domich","year":"1987","unstructured":"P.D. Domich, R. Kannan and L.E. Trotter: Hermite Normal Form Computation using modulo Determinant Arithmetic, Mathematics of Operation Research, vol. 12(1), pp. 50\u201359, 1987.","journal-title":"Mathematics of Operation Research"},{"issue":"3","key":"29_CR7","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1137\/0218037","volume":"18","author":"M.L. Furst","year":"1989","unstructured":"M.L. Furst and R. Kannan: Succinct Certificates for Almost all Subset Sum Problems, SIAM Journal on Computing, vol. 18(3), pp. 550\u2013558, 1989.","journal-title":"SIAM Journal on Computing"},{"key":"29_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/BFb0052231","volume-title":"Crypto\u2019 97","author":"O. Goldreich","year":"1997","unstructured":"O. Goldreich, S. Goldwasser, S. Halevi: Public-Key Cryptosystems from Lattice Reduction Problems, Crypto\u2019 97, LNCS #1294, pp. 112\u2013131."},{"issue":"3","key":"29_CR9","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1287\/moor.12.3.415","volume":"12","author":"R. Kannan","year":"1987","unstructured":"R. Kannan: Minkowski\u2019s Convex Body Theorem and Integer Programming, Mathematics of Operation Research, vol. 12(3), pp. 415\u2013440, 1987.","journal-title":"Mathematics of Operation Research"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Y. Kitaoka: Arithmetic of Quadratic Forms, Cambridge Tracts in Mathematics, vol. 106, Cambridge University Press, 1993.","DOI":"10.1017\/CBO9780511666155"},{"key":"29_CR11","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A.K. Lenstra","year":"1982","unstructured":"A.K. Lenstra, H.W. Lenstra and L. Lov\u00e1sz: Factoring Polynomials with Rational Coefficients, Mathematische Annalen, vol. 261, pp. 515\u2013534, 1982.","journal-title":"Mathematische Annalen"},{"key":"29_CR12","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/BF02128669","volume":"10","author":"J.C. Lagarias","year":"1990","unstructured":"J.C. Lagarias, H.W. Lenstra and C.P. Schnorr: Korkin-Zolotarev Bases and successive Minima of a Lattice and its Reciprocal Lattice, Combinatorica, vol. 10, pp. 333\u2013348, 1990.","journal-title":"Combinatorica"},{"key":"29_CR13","volume-title":"Handbook of Matrices","author":"H. L\u00fctkepohl","year":"1996","unstructured":"H. L\u00fctkepohl: Handbook of Matrices, John Wiley & Son, England, 1996."},{"key":"29_CR14","unstructured":"F.J. Macwilliams and N.J. Sloane: The Theory of Error Correcting Codes, Mathematical Library Vol. 16, North-Holland, 1977."},{"key":"29_CR15","unstructured":"J. Martinet: Les R\u00e9seaux Parfaits des Espaces Euclidiens, Masson, 1996."},{"issue":"1","key":"29_CR16","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/BF01571276","volume":"110","author":"J.E. Mazo","year":"1990","unstructured":"J.E. Mazo and A.M. Oodlyzko: Lattice Points in high-dimensional Spheres, Monatshefte Mathematik, vol. 110(1), pp. 47\u201361, 1990.","journal-title":"Monatshefte Mathematik"},{"key":"29_CR17","series-title":"Lect Notes Comput Sci","volume-title":"Crypto\u2019 99","author":"P. Nguyen","year":"1999","unstructured":"P. Nguyen: Cryptanalysis of the Goldreich-Goldwasser-Halevi Cryptosystem from Crypto\u2019 97, Crypto\u2019 99, LNCS #???."},{"key":"29_CR18","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1142\/S0218196797000241","volume":"7","author":"E. Obrien","year":"1997","unstructured":"E. O\u2019brien and C.R. Leedham-Green: Recognising Tensor Products of Matrix Groups, Int. Journal Algebra Computing, vol. 7, pp. 541\u2013559, 1997.","journal-title":"Int. Journal Algebra Computing"},{"key":"29_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1007\/3-540-18088-5_33","volume-title":"14.th ICALP","author":"A. Paz","year":"1987","unstructured":"A. Paz and C.P. Schnorr: Approximating Integer Lattices by Lattices with cyclic Factor Group, 14.th ICALP, LNCS #267, pp. 386\u2013393, 1987."},{"issue":"5","key":"29_CR20","doi-asserted-by":"publisher","first-page":"624","DOI":"10.1109\/TIT.1970.1054504","volume":"16","author":"S.M. Reddy","year":"1970","unstructured":"S.M. Reddy: On Decoding Iterated Codes, IEEE Transaction on Information Theory, Vol. 16(5), pp. 624\u2013627, 1970.","journal-title":"IEEE Transaction on Information Theory"},{"key":"29_CR21","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0304-3975(87)90064-8","volume":"53","author":"C.P. Schnorr","year":"1987","unstructured":"C.P. Schnorr: A Hierarchy of Polynomial Time Lattice Basis Reduction Algorithms, Theoretical Computer Science, vol. 53, pp. 201\u2013224, 1987.","journal-title":"Theoretical Computer Science"},{"key":"29_CR22","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1017\/S0963548300001371","volume":"3","author":"C.P. Schnorr","year":"1994","unstructured":"C.P. Schnorr: Block Reduced Lattice Bases and Successive Minima, Combinatorics, Probability and Computing, vol. 3, pp. 507\u2013522, 1994.","journal-title":"Combinatorics, Probability and Computing"},{"key":"29_CR23","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"Eurocrypt\u2019 95","author":"C.P. Schnorr","year":"1995","unstructured":"C.P. Schnorr and H.H. H\u00fcorner: Attacking the Chor-Rivest Cryptosystem by improved Lattice Reduction, Eurocrypt\u2019 95, LNCS #921, pp. 1\u201312, 1995."},{"key":"29_CR24","unstructured":"C.P. Schnorr, M. Fischlin, R. Fischlin, H. Koy and A. May: Lattice Attacks on the GGH Cryptosystem, Crypto\u2019 97 Rump Session, 1997."},{"key":"29_CR25","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/3-540-39466-4_6","volume-title":"Workshop on Cryptography Burg Feuerstein","author":"N.J.A. Sloane","year":"1983","unstructured":"N.J.A. Sloane: Encryption by Random Rotations, Workshop on Cryptography Burg Feuerstein, 1982, LNCS #149, pp. 71\u2013128, 1983."},{"key":"29_CR26","unstructured":"D.R. Stinson: Cryptography: Theory and Practice, CRC Press, 1995."}],"container-title":["Lecture Notes in Computer Science","Cryptography and Coding"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46665-7_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,2]],"date-time":"2020-04-02T19:29:14Z","timestamp":1585855754000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46665-7_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540668879","9783540466659"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-46665-7_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"19 November 1999","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}