{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T14:40:36Z","timestamp":1738248036576,"version":"3.35.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540681595"},{"type":"electronic","value":"9783540681649"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68164-9_11","type":"book-chapter","created":{"date-parts":[[2008,5,30]],"date-time":"2008-05-30T10:48:34Z","timestamp":1212144514000},"page":"156-173","source":"Crossref","is-referenced-by-count":13,"title":["New Definition of Density on Knapsack Cryptosystems"],"prefix":"10.1007","author":[{"given":"Noboru","family":"Kunihiro","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: The Shortest Vector Problem in L 2 is NP-hard for Randomized Reductions. In: Proc. of 30th STOC, ACM, pp. 11\u201320 (1998)","DOI":"10.1145\/276698.276705"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/3-540-39568-7_6","volume-title":"Advances in Cryptology","author":"B. Chor","year":"1985","unstructured":"Chor, B., Rivest, R.L.: A Knapsack-type Public Key Cryptosystem based on Arithmetic in Finite Fields. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol.\u00a0196, pp. 54\u201365. Springer, Heidelberg (1985)"},{"key":"11_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. Computational Complexity\u00a02, 111\u2013128 (1992)","journal-title":"Computational Complexity"},{"key":"11_CR4","doi-asserted-by":"crossref","DOI":"10.1002\/0471200611","volume-title":"Elements of Information Theory","author":"T.M. Cover","year":"1991","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley-Interscience, Chichester (1991)"},{"key":"11_CR5","first-page":"901","volume":"IT-19,","author":"C.M. Cover","year":"1973","unstructured":"Cover, C.M.: Enumerative Source Encoding. IEEE Trans. on Information Theory\u00a0IT 19, 901\u2013909 (1973)","journal-title":"IEEE Trans. on Information Theory"},{"issue":"1","key":"11_CR6","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s10623-007-9058-5","volume":"43","author":"T. Izu","year":"2007","unstructured":"Izu, T., Kogure, J., Koshiba, T., Shimoyama, T.: Low-Density Attack Revisited. Designs, Codes and Cryptography\u00a043(1), 47\u201359 (2007) (Preliminary version appeared in 2004)","journal-title":"Designs, Codes and Cryptography"},{"issue":"1","key":"11_CR7","doi-asserted-by":"crossref","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 Association for Computing Machinery\u00a032(1), 229\u2013246 (1985)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"11_CR8","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":"11_CR9","doi-asserted-by":"publisher","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 Trans. on Information Theory\u00a024, 525\u2013530 (1978)","journal-title":"IEEE Trans. on Information Theory"},{"key":"11_CR10","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. Nguyen","year":"2005","unstructured":"Nguyen, P., 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":"11_CR11","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":"11_CR12","first-page":"1564","volume":"87-A","author":"K. Omura","year":"2004","unstructured":"Omura, K., Tanaka, K.: Density Attack to Knapsack Cryptosystems with Enumerative Source Encoding. IEICE Transactions on Fundamentals\u00a087-A(6), 1564\u20131569 (2004)","journal-title":"IEICE Transactions on Fundamentals"},{"key":"11_CR13","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.: 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)"},{"issue":"3","key":"11_CR14","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1137\/0210033","volume":"10","author":"R. Schroppel","year":"1981","unstructured":"Schroppel, R., Shamir, A.: A T\u2009=\u2009O(2 n\/2), S\u2009=\u2009O(2 n\/4) Algorithm for Certain NP-Complete Problems. SIAM J.Computing\u00a010(3), 456\u2013464 (1981)","journal-title":"SIAM J.Computing"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Shor, P.W.: Algorithms for Quantum Computation: Discrete Log and Factoring. In: Proc. of 35th FOCS, pp. 124\u2013134 (1994)","DOI":"10.1109\/SFCS.1994.365700"},{"key":"11_CR16","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1090\/S0025-5718-01-01310-2","volume":"71","author":"D.R. Stinson","year":"2002","unstructured":"Stinson, D.R.: Some Baby-Step Giant-Step Algorithms for the Low Hamming Weight Discrete Logarithm Problem. Mathematics of Computation\u00a071, 379\u2013391 (2002)","journal-title":"Mathematics of Computation"},{"key":"11_CR17","unstructured":"van Emde Boas, P.: Another NP-complete Problem and the Complexity Computing Short Vectors in a Lattice. TR81-04, Mathematische Instituut, University of Amsterdam (1981)"},{"key":"11_CR18","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s001450010005","volume":"14","author":"S. Vaudenay","year":"2001","unstructured":"Vaudenay, S.: Cryptanalysis of the Chor-Rivest Cryptosystem. Journal of Cryptology\u00a014, 87\u2013100 (2001)","journal-title":"Journal of Cryptology"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 AFRICACRYPT 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68164-9_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T14:12:24Z","timestamp":1738246344000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68164-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540681595","9783540681649"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68164-9_11","relation":{},"subject":[]}}