{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T05:30:57Z","timestamp":1740547857060,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":69,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642153167"},{"type":"electronic","value":"9783642153174"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15317-4_21","type":"book-chapter","created":{"date-parts":[[2010,9,10]],"date-time":"2010-09-10T02:46:58Z","timestamp":1284086818000},"page":"329-344","source":"Crossref","is-referenced-by-count":2,"title":["Recursive Lattice Reduction"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Plantard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Willy","family":"Susilo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","unstructured":"The GNU multiple precision arithmetic librairy"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Adleman, L.M.: On breaking generalized knapsack public key cryptosystems (abstract). In: STOC, pp. 402\u2013412 (1983)","DOI":"10.1145\/800061.808771"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: Twenty-Eighth Annual ACM Symposium on the Theory of Computing (STOC 1996), pp. 99\u2013108 (1996)","DOI":"10.1145\/237814.237838"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: The shortest vector problem in $l_{\\rm \\mbox{2}}$ is NP-hard for randomized reductions (extended abstract). In: Thirtieth Annual ACM Symposium on the Theory of Computing (STOC 1998), pp. 10\u201319 (1998)","DOI":"10.1145\/276698.276705"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Random lattices and a conjectured 0 - 1 law about their polynomial time computable properties. In: FOCS, pp. 733\u2013742 (2002)","DOI":"10.1109\/SFCS.2002.1181998"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Representing hard lattices with o(n log n) bits. In: STOC, pp. 94\u2013103 (2005)","DOI":"10.1145\/1060590.1060604"},{"key":"21_CR7","unstructured":"Ajtai, M.: Generating random lattices according to the invariant distribution (2006)"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Dwork, C.: A public-key cryptosystem with worst-case\/average-case equivalence. In: Twenty-Ninth Annual ACM Symposium on the Theory of Computing (STOC 1997), pp. 284\u2013293 (1997)","DOI":"10.1145\/258533.258604"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Kumar, R., Sivakumar, D.: A sieve algorithm for the shortest lattice vector problem. In: 33rd Annual ACM Symposium on Theory of Computing (STOC 2001), pp. 601\u2013610 (2001)","DOI":"10.1145\/380752.380857"},{"key":"21_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-540-73420-8_8","volume-title":"Automata, Languages and Programming","author":"J. Bl\u00f6mer","year":"2007","unstructured":"Bl\u00f6mer, J., Naewe, S.: Sampling methods for shortest vectors, closest vectors and successive minima. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 65\u201377. Springer, Heidelberg (2007)"},{"issue":"2","key":"21_CR11","first-page":"203","volume":"46","author":"D. Boneh","year":"1999","unstructured":"Boneh, D.: Twenty years of attacks on the rsa cryptosystem. Notices of the American Mathematical Society (AMS)\u00a046(2), 203\u2013213 (1999)","journal-title":"Notices of the American Mathematical Society (AMS)"},{"key":"21_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1007\/3-540-48405-1_21","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"D. Boneh","year":"1999","unstructured":"Boneh, D., Durfee, G., Howgrave-Graham, N.: Factoring n = p $^{\\mbox{r}}$ q for large r. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 326\u2013337. Springer, Heidelberg (1999)"},{"key":"21_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-540-88403-3_6","volume-title":"Post-Quantum Cryptography","author":"J. Buchmann","year":"2008","unstructured":"Buchmann, J., Lindner, R., R\u00fcckert, M.: Explicit hard instances of the shortest vector problem. In: Buchmann, J., Ding, J. (eds.) PQCrypto 2008. LNCS, vol.\u00a05299, pp. 79\u201394. Springer, Heidelberg (2008)"},{"key":"21_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/3-540-48892-8_18","volume-title":"Selected Areas in Cryptography","author":"J.-Y. Cai","year":"1999","unstructured":"Cai, J.-Y., Cusick, T.W.: A lattice-based public-key cryptosystem. In: Tavares, S., Meijer, H. (eds.) SAC 1998. LNCS, vol.\u00a01556, pp. 219\u2013233. Springer, Heidelberg (1999)"},{"key":"21_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-62035-5","volume-title":"An Introduction to the Geometry of Numbers","author":"J.W.S. Cassels","year":"1959","unstructured":"Cassels, J.W.S.: An Introduction to the Geometry of Numbers. Springer, Heidelberg (1959)"},{"issue":"5","key":"21_CR16","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1109\/18.21214","volume":"34","author":"B. Chor","year":"1988","unstructured":"Chor, B., Rivest, R.L.: A knapsack-type public key cryptosystem based on arithmetic in finite fields. IEEE Transactions on Information Theory\u00a034(5), 901\u2013909 (1988)","journal-title":"IEEE Transactions on Information Theory"},{"key":"21_CR17","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02945-9","volume-title":"A course in computational algebraic number theory","author":"H. Cohen","year":"1993","unstructured":"Cohen, H.: A course in computational algebraic number theory. Graduate Texts in Mathematics, vol.\u00a0138. Springer, Heidelberg (1993)"},{"issue":"2","key":"21_CR18","doi-asserted-by":"publisher","first-page":"689","DOI":"10.4007\/annals.2003.157.689","volume":"157","author":"H. Cohn","year":"2003","unstructured":"Cohn, H., Elkies, N.: New upper bounds on sphere packings i. Annals of Mathematics\u00a0157(2), 689\u2013714 (2003)","journal-title":"Annals of Mathematics"},{"key":"21_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2016-7","volume-title":"Sphere Packings, Lattices and Groups","author":"J.H. Conway","year":"1988","unstructured":"Conway, J.H., Sloane, N.J.A.: Sphere Packings, Lattices and Groups. Springer, Heidelberg (1988)"},{"key":"21_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/3-540-68339-9_14","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"D. Coppersmith","year":"1996","unstructured":"Coppersmith, D.: Finding a small root of a univariate modular equation. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 155\u2013165. Springer, Heidelberg (1996)"},{"issue":"4","key":"21_CR21","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s001459900030","volume":"10","author":"D. Coppersmith","year":"1997","unstructured":"Coppersmith, D.: Small solutions to polynomial equations, and low exponent rsa vulnerabilities. J. Cryptology\u00a010(4), 233\u2013260 (1997)","journal-title":"J. Cryptology"},{"key":"21_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/3-540-44670-2_3","volume-title":"Cryptography and Lattices","author":"D. Coppersmith","year":"2001","unstructured":"Coppersmith, D.: Finding small solutions to small degree polynomials. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol.\u00a02146, pp. 20\u201331. Springer, Heidelberg (2001)"},{"key":"21_CR23","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":"21_CR24","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., LaMacchia, B.A., Odlyzko, A.M., Schnorr, C.-P., Stern, J.: Improved low-density subset sum algorithms. Computational Complexity\u00a02, 111\u2013128 (1992)","journal-title":"Computational Complexity"},{"key":"21_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1007\/3-540-46416-6_4","volume-title":"Advances in Cryptology - EUROCRYPT \u201991","author":"M.J. Coster","year":"1991","unstructured":"Coster, M.J., LaMacchia, B.A., Odlyzko, A.M.: An iproved low-denisty subset sum algorithm. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol.\u00a0547, pp. 54\u201367. Springer, Heidelberg (1991)"},{"issue":"6","key":"21_CR26","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"-22","author":"W. Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Transactions on Information Theory\u00a0 IT-22(6), 644\u2013654 (1976)","journal-title":"IEEE Transactions on Information Theory IT"},{"key":"21_CR27","doi-asserted-by":"crossref","unstructured":"Fischlin, R., Seifert, J.-P.: Tensor-based trapdoors for cvp and their application to public key cryptography. In: IMA Int. Conf., pp. 244\u2013257 (1999)","DOI":"10.1007\/3-540-46665-7_29"},{"key":"21_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-78967-3_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"N. Gama","year":"2008","unstructured":"Gama, N., Nguyen, P.Q.: Predicting lattice reduction. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 31\u201351. Springer, Heidelberg (2008)"},{"key":"21_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BFb0052230","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"O. Goldreich","year":"1997","unstructured":"Goldreich, O., Goldwasser, S., Halevi, S.: Eliminating decryption errors in the ajtai-dwork cryptosystem. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 105\u2013111. Springer, Heidelberg (1997)"},{"key":"21_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/BFb0052231","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"O. Goldreich","year":"1997","unstructured":"Goldreich, O., Goldwasser, S., Halevi, S.: Public-key cryptosystems from lattice reductions problems. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 112\u2013131. Springer, Heidelberg (1997)"},{"key":"21_CR31","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1515\/form.2003.009","volume":"15","author":"D. Goldstein","year":"2003","unstructured":"Goldstein, D., Mayer, A.: On the equidistribution of Hecke points. Forum Mathematicum\u00a015, 165\u2013189 (2003)","journal-title":"Forum Mathematicum"},{"key":"21_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-540-71677-8_8","volume-title":"Public Key Cryptography \u2013 PKC 2007","author":"D. Han","year":"2007","unstructured":"Han, D., Kim, M.-H., Yeom, Y.: Cryptanalysis of the paeng-jung-ha cryptosystem from pkc 2003. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol.\u00a04450, pp. 107\u2013117. Springer, Heidelberg (2007)"},{"key":"21_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-540-74143-5_10","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"G. Hanrot","year":"2007","unstructured":"Hanrot, G., Stehle, D.: Improved analysis of Kannan\u2019s shortest lattice vector algorithm. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622, pp. 170\u2013186. Springer, Heidelberg (2007)"},{"key":"21_CR34","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":"21_CR35","doi-asserted-by":"crossref","unstructured":"Kannan, R.: Improved algorithms for integer programming and related lattice problems. In: Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing, Boston, Massachusetts, pp. 193\u2013206 (April 1983)","DOI":"10.1145\/800061.808749"},{"issue":"3","key":"21_CR36","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1287\/moor.12.3.415","volume":"12","author":"R. Kannan","year":"1987","unstructured":"Kannan, R.: Minkowski\u2019s convex body theorem and integer programming. Math. Oper. Res.\u00a012(3), 415\u2013440 (1987)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"21_CR37","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 Journal of Computing\u00a08(4), 499\u2013507 (1979)","journal-title":"SIAM Journal of Computing"},{"key":"21_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-540-71677-8_21","volume-title":"Public Key Cryptography \u2013 PKC 2007","author":"A. Kawachi","year":"2007","unstructured":"Kawachi, A., Tanaka, K., Xagawa, K.: Multi-bit cryptosystems based on lattice problems. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol.\u00a04450, pp. 315\u2013329. Springer, Heidelberg (2007)"},{"issue":"1","key":"21_CR39","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1145\/2455.2461","volume":"32","author":"J.C. Lagarias","year":"1985","unstructured":"Lagarias, J.C., Odlyzko, A.M.: Solving low-density subset sum problems. Journal of the ACM\u00a032(1), 229\u2013246 (1985)","journal-title":"Journal of the ACM"},{"key":"21_CR40","first-page":"513","volume-title":"Mathematische Annalen","author":"A.K. Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra, H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. In: Mathematische Annalen, vol.\u00a0261, pp. 513\u2013534. Springer, Heidelberg (1982)"},{"key":"21_CR41","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, vol.\u00a050. SIAM Publications, Philadelphia (1986)"},{"key":"21_CR42","first-page":"114","volume":"44","author":"R.J. McEliece","year":"1978","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. Deep Space Network Progress Report\u00a044, 114\u2013116 (1978)","journal-title":"Deep Space Network Progress Report"},{"issue":"5","key":"21_CR43","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1109\/TIT.1978.1055927","volume":"-24","author":"R.C. Merkle","year":"1978","unstructured":"Merkle, R.C., Hellman, M.E.: Hiding information and signatures in trapdoor knapsacks. IEEE Transactions on Information Theory\u00a0IT-24(5), 525\u2013530 (1978)","journal-title":"IEEE Transactions on Information Theory IT"},{"key":"21_CR44","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":"21_CR45","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 Publishers, Dordrecht (2002)"},{"key":"21_CR46","volume-title":"Post-quantum Cryprography","author":"D. Micciancio","year":"2008","unstructured":"Micciancio, D., Regev, O.: Lattice-based cryptography. In: Bernstein, D.J., Buchmann, J., Dahmen, E. (eds.) Post-quantum Cryprography. Springer, Heidelberg (2008)"},{"key":"21_CR47","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Warinschi, B.: A linear space algorithm for computing the Hermite normal form. In: International Symposium on Symbolic Algebraic Computation (ISSAC 2001), pp. 231\u2013236 (2001)","DOI":"10.1145\/384101.384133"},{"key":"21_CR48","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-88330-9","volume-title":"Symmetric bilinear forms","author":"J. Milnor","year":"1973","unstructured":"Milnor, J., Husemoller, D.: Symmetric bilinear forms. Springer, Heidelberg (1973)"},{"key":"21_CR49","volume-title":"Geometrie der Zahlen","author":"H. Minkowski","year":"1896","unstructured":"Minkowski, H.: Geometrie der Zahlen. B. G. Teubner, Leipzig (1896)"},{"key":"21_CR50","doi-asserted-by":"crossref","unstructured":"Nguyen, P.Q.: Cryptanalysis of the Goldreich-Goldwasser-Halevi cryptosystem from crypto 1997. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 288\u2013304. Springer, Heidelberg (1999)","DOI":"10.1007\/3-540-48405-1_18"},{"key":"21_CR51","doi-asserted-by":"crossref","unstructured":"Nguyen, P.Q.: Public-Key Cryptanalysis. Contemporary Mathematics. AMS\u2013RSME (2008)","DOI":"10.1090\/conm\/477\/09304"},{"key":"21_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/11426639_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"P.Q. Nguyen","year":"2005","unstructured":"Nguyen, P.Q., Stehl\u00e9, D.: Floating-point LLL revisited. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 215\u2013233. Springer, Heidelberg (2005)"},{"key":"21_CR53","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)"},{"key":"21_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/BFb0055731","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"P.Q. Nguyen","year":"1998","unstructured":"Nguyen, P.Q., Stern, J.: Cryptanalysis of the ajtai-dwork cryptosystem. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 223\u2013242. Springer, Heidelberg (1998)"},{"key":"21_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/11593447_3","volume-title":"Advances in Cryptology - ASIACRYPT 2005","author":"P.Q. Nguyen","year":"2005","unstructured":"Nguyen, P.Q., Stern, J.: Adapting density attacks to low-weight knapsacks. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol.\u00a03788, pp. 41\u201358. Springer, Heidelberg (2005)"},{"key":"21_CR56","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1090\/psapm\/042\/1095552","volume":"42","author":"A.M. Odlyzko","year":"1990","unstructured":"Odlyzko, A.M.: The rise and fall of knapsack cryptosystems. Cryptology and Computational Number Theory\u00a042, 75\u201388 (1990)","journal-title":"Cryptology and Computational Number Theory"},{"key":"21_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/3-540-44598-6_9","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"T. Okamoto","year":"2000","unstructured":"Okamoto, T., Tanaka, K., Uchiyama, S.: Quantum public-key cryptosystems. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 147\u2013165. Springer, Heidelberg (2000)"},{"issue":"6","key":"21_CR58","first-page":"1564","volume":"87","author":"K. Omura","year":"2004","unstructured":"Omura, K., Tanaka, K.: Density attack to the knapsack cryptosystems with enumerative source encoding. IEICE Trans Fundam. Electron Commun. Comput. Sci.\u00a087(6), 1564\u20131569 (2004)","journal-title":"IEICE Trans Fundam. Electron Commun. Comput. Sci."},{"key":"21_CR59","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/3-540-36288-6_22","volume-title":"Public Key Cryptography - PKC 2003","author":"S.-H. Paeng","year":"2003","unstructured":"Paeng, S.-H., Jung, B.E., Ha, K.-C.: A lattice based public key cryptosystem using polynomial representations. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol.\u00a02567, pp. 292\u2013308. Springer, Heidelberg (2003)"},{"key":"21_CR60","doi-asserted-by":"crossref","unstructured":"Regev, O.: Improved inapproximability of lattice and coding problems with preprocessing. In: IEEE Conference on Computational Complexity, pp. 363\u2013370 (2003)","DOI":"10.1109\/CCC.2003.1214435"},{"key":"21_CR61","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: STOC, pp. 84\u201393 (2005)","DOI":"10.1145\/1060590.1060603"},{"issue":"2","key":"21_CR62","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. Rivest","year":"1978","unstructured":"Rivest, R., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM\u00a021(2), 120\u2013126 (1978)","journal-title":"Communications of the ACM"},{"issue":"2-3","key":"21_CR63","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0304-3975(87)90064-8","volume":"53","author":"C.-P. Schnorr","year":"1987","unstructured":"Schnorr, C.-P.: A hierarchy of polynomial time lattice basis reduction algorithms. Theoretical Computer Science\u00a053(2-3), 201\u2013224 (1987)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"21_CR64","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0196-6774(88)90004-1","volume":"9","author":"C.-P. Schnorr","year":"1988","unstructured":"Schnorr, C.-P.: A more efficient algorithm for lattice basis reduction. Journal of Algorithms\u00a09(1), 47\u201362 (1988)","journal-title":"Journal of Algorithms"},{"issue":"1","key":"21_CR65","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2005.04.004","volume":"204","author":"C.-P. Schnorr","year":"2006","unstructured":"Schnorr, C.-P.: Fast LLL-type lattice reduction. Information and Computation\u00a0204(1), 1\u201325 (2006)","journal-title":"Information and Computation"},{"key":"21_CR66","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Advances in Cryptology - EUROCRYPT \u201995","author":"C.-P. Schnorr","year":"1995","unstructured":"Schnorr, C.-P., H\u00f6rner, H.H.: Attacking the chor-rivest cryptosystem by improved lattice reduction. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol.\u00a0921, pp. 1\u201312. Springer, Heidelberg (1995)"},{"key":"21_CR67","doi-asserted-by":"crossref","unstructured":"Shamir, A.: A polynomial time algorithm for breaking the basic merkle-hellman cryptosystem. In: McCurley, K.S., Ziegler, C.D. (eds.) CRYPTO 1982. LNCS, vol.\u00a01440, pp. 279\u2013288. Springer, Heidelberg (1999)","DOI":"10.1007\/978-1-4757-0602-4_27"},{"issue":"5","key":"21_CR68","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1109\/TIT.1984.1056964","volume":"30","author":"A. Shamir","year":"1984","unstructured":"Shamir, A.: A polynomial-time algorithm for breaking the basic merkle-hellman cryptosystem. IEEE Transactions on Information Theory\u00a030(5), 699\u2013704 (1984)","journal-title":"IEEE Transactions on Information Theory"},{"key":"21_CR69","unstructured":"Shoup, V.: NTL: Number theory library"}],"container-title":["Lecture Notes in Computer Science","Security and Cryptography for Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15317-4_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T17:44:16Z","timestamp":1740505456000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15317-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642153167","9783642153174"],"references-count":69,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15317-4_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}