{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:01:42Z","timestamp":1725552102366},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540306849"},{"type":"electronic","value":"9783540322672"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11593447_3","type":"book-chapter","created":{"date-parts":[[2005,11,15]],"date-time":"2005-11-15T06:37:16Z","timestamp":1132036636000},"page":"41-58","source":"Crossref","is-referenced-by-count":24,"title":["Adapting Density Attacks to Low-Weight Knapsacks"],"prefix":"10.1007","author":[{"given":"Phong Q.","family":"Nguy\u00ea\u0303n","sequence":"first","affiliation":[]},{"given":"Jacques","family":"Stern","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/3-540-45539-6_4","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"D. Bleichenbacher","year":"2000","unstructured":"Bleichenbacher, D., Nguy\u00ean, P.Q.: Noisy polynomial interpolation and noisy Chinese remaindering. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, p. 53. Springer, Heidelberg (2000)"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Chor, B., Rivest, R.L.: A knapsack-type public key cryptosystem based on arithmetic in finite fields. IEEE Trans. Inform. Theory\u00a034 (1988)","DOI":"10.1109\/18.21214"},{"key":"3_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., LaMacchia, B.A., Odlyzko, A.M., Schnorr, C.-P., Stern, J.: Improved low-density subset sum algorithms. Comput. Complexity\u00a02, 111\u2013128 (1992)","journal-title":"Comput. Complexity"},{"key":"#cr-split#-3_CR4.1","doi-asserted-by":"crossref","unstructured":"Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: a ring based public key cryptosystem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol.??1423, pp. 267???288. Springer, Heidelberg (1998);","DOI":"10.1007\/BFb0054868"},{"key":"#cr-split#-3_CR4.2","unstructured":"Additional information and updates at http:\/\/www.ntru.com"},{"issue":"3","key":"3_CR5","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."},{"key":"3_CR6","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":"3_CR7","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/BF00196908","volume":"3","author":"H.W. Lenstra Jr.","year":"1991","unstructured":"Lenstra Jr., H.W.: On the Chor-Rivest knapsack cryptosystem. J. of Cryptology\u00a03, 149\u2013155 (1991)","journal-title":"J. of Cryptology"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/3-540-44670-2_10","volume-title":"Cryptography and Lattices","author":"A. May","year":"2001","unstructured":"May, A., Silverman, J.: Dimension Reduction Methods for Convolution Modular Lattices. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol.\u00a02146, p. 110. Springer, Heidelberg (2001)"},{"key":"3_CR9","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":"3_CR10","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1109\/TIT.1978.1055927","volume":"-24","author":"R. Merkle","year":"1978","unstructured":"Merkle, R., Hellman, M.: Hiding information and signatures in trapdoor knapsacks. IEEE Trans. Inform. Theory\u00a0IT-24, 525\u2013530 (1978)","journal-title":"IEEE Trans. Inform. Theory IT"},{"issue":"3","key":"3_CR11","doi-asserted-by":"publisher","first-page":"1212","DOI":"10.1109\/18.915688","volume":"47","author":"D. Micciancio","year":"2001","unstructured":"Micciancio, D.: The hardness of the closest vector problem with preprocessing. IEEE Trans. Inform. Theory\u00a047(3), 1212\u20131215 (2001)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"3_CR12","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, Boston (2002)"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1007\/3-540-48405-1_18","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"P.Q. Nguy\u00ean","year":"1999","unstructured":"Nguy\u00ean, 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)"},{"issue":"3","key":"3_CR14","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s00145-002-0021-3","volume":"15","author":"P.Q. Nguy\u00ean","year":"2002","unstructured":"Nguy\u00ean, P.Q., Shparlinski, I.E.: The Insecurity of the Digital Signature Algorithm with Partially Known Nonces. Journal of Cryptology\u00a015(3), 151\u2013176 (2002)","journal-title":"Journal of Cryptology"},{"key":"3_CR15","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. Nguy\u00ean","year":"2005","unstructured":"Nguy\u00ean, 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":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1007\/BFb0052236","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"P.Q. Nguy\u00ean","year":"1997","unstructured":"Nguy\u00ean, P.Q., Stern, J.: Merkle-Hellman revisited: a cryptanalysis of the Qu-Vanstone cryptosystem based on group factorizations. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 198\u2013212. Springer, Heidelberg (1997)"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/3-540-44670-2_12","volume-title":"Cryptography and Lattices","author":"P.Q. Nguy\u00ean","year":"2001","unstructured":"Nguy\u00ean, P.Q., Stern, J.: The two faces of lattices in cryptology. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol.\u00a02146, p. 146. Springer, Heidelberg (2001)"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Odlyzko, A.M.: The rise and fall of knapsack cryptosystems. In: Cryptology and Computational Number Theory. Proc. of Symposia in Applied Mathematics, vol.\u00a042, pp. 75\u201388. A.M.S (1990)","DOI":"10.1090\/psapm\/042\/1095552"},{"key":"3_CR19","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, p. 147. Springer, Heidelberg (2000)"},{"key":"3_CR20","unstructured":"Omura, K., Tanaka, K.: Density Attack to the Knapsack Cryptosystems with Enumerative Source Encoding. IEICE Trans. Fundamentals\u00a0E84-A(1) (January 2001)"},{"key":"3_CR21","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":"3_CR22","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s001450010005","volume":"14","author":"S. Vaudenay Cryptanalysis","year":"2001","unstructured":"Vaudenay Cryptanalysis, S.: of the Chor-Rivest Cryptosystem. Journal of Cryptology\u00a014, 87\u2013100 (2001)","journal-title":"Journal of Cryptology"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - ASIACRYPT 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11593447_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:02:43Z","timestamp":1605643363000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11593447_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540306849","9783540322672"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/11593447_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}