{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:51:29Z","timestamp":1725889889293},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642329272"},{"type":"electronic","value":"9783642329289"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32928-9_18","type":"book-chapter","created":{"date-parts":[[2012,8,30]],"date-time":"2012-08-30T02:38:30Z","timestamp":1346294310000},"page":"326-342","source":"Crossref","is-referenced-by-count":1,"title":["New Attacks for Knapsack Based Cryptosystems"],"prefix":"10.1007","author":[{"given":"Gottfried","family":"Herold","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Meurer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"18_CR1","doi-asserted-by":"publisher","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\u00a022(6), 644\u2013654 (1976)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"5","key":"18_CR2","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1109\/TIT.1978.1055927","volume":"24","author":"R. 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) (September 1978)","journal-title":"IEEE Transactions on Information Theory"},{"key":"18_CR3","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness"},{"key":"18_CR4","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/978-1-4684-4730-9_2","volume-title":"Advances in Cryptology","author":"Ernest F. Brickell","year":"1984","unstructured":"Brickell, E.F.: Solving Low Density Knapsacks. In: Chaum, D. (ed.) Advances in Cryptology, Proceedings of CRYPTO 1983, pp. 25\u201337. Plenum Press, New York (1983)"},{"key":"18_CR5","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/978-1-4684-4730-9_3","volume-title":"Advances in Cryptology","author":"E. F. Brickell","year":"1984","unstructured":"Brickell, E.F., Lagarias, J.C., Odlyzko, A.M.: Evaluation of the Adleman Attack on Multiply Iterated Knapsack Cryptosystems. In: Chaum, D. (ed.) Advances in Cryptology, Proceedings of CRYPTO 1983, pp. 39\u201342. Plenum Press, New York (1983)"},{"key":"18_CR6","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-1-4684-4730-9_1","volume-title":"Advances in Cryptology","author":"J. C. Lagarias","year":"1984","unstructured":"Lagarias, J.C.: Knapsack Public Key Cryptosystems and Diophantine Approximation. In: Chaum, D. (ed.) Advances in Cryptology, Proceedings of CRYPTO 1983, pp. 3\u201323. Plenum Press, New York (1983)"},{"issue":"4","key":"18_CR7","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H. W. Lenstra","year":"1983","unstructured":"Lenstra, H.W.: Integer Programming with a Fixed Number of Variables. Mathematics of Operations Research\u00a08(4) (November 1983)","journal-title":"Mathematics of Operations Research"},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/3-540-39568-7_27","volume-title":"Advances in Cryptology","author":"E.F. Brickell","year":"1985","unstructured":"Brickell, E.F.: Breaking Iterated Knapsacks. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol.\u00a0196, pp. 342\u2013358. Springer, Heidelberg (1985)"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/3-540-13345-3_28","volume-title":"Automata, Languages, and Programming","author":"J.C. Lagarias","year":"1984","unstructured":"Lagarias, J.C.: Performance Analysis of Shamir\u2019s Attack on the Basic Merkle-Hellman Knapsack Cryptosystem. In: Paredaens, J. (ed.) ICALP 1984. LNCS, vol.\u00a0172, pp. 312\u2013323. Springer, Heidelberg (1984)"},{"issue":"5","key":"18_CR10","doi-asserted-by":"crossref","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\u00a0IT-30(5) (September 1984)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"18_CR11","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"},{"issue":"5","key":"18_CR12","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1109\/5.4443","volume":"76","author":"E.F. Brickel","year":"1988","unstructured":"Brickel, E.F., Odlyzko, M.: Cryptanalysis: A Survey of Recent Results. Proceedings of the IEEE\u00a076(5), 578\u2013593 (1988)","journal-title":"Proceedings of the IEEE"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Odlyzko, A.M.: The rise and fall of knapsack cryptosystems. In: Cryptology and Computational Number Theory. Proc. Symp. Appl. Math., vol.\u00a042, pp. 75\u201388. Am. Math. Soc. (1990)","DOI":"10.1090\/psapm\/042\/1095552"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/3-540-54458-5_70","volume-title":"Fundamentals of Computation Theory","author":"A. Joux","year":"1991","unstructured":"Joux, A., Stern, J.: Improving the Critical Density of the Lagarias-Odlyzko Attack Against Subset Sum Problems. In: Budach, L. (ed.) FCT 1991. LNCS, vol.\u00a0529, pp. 258\u2013264. Springer, Heidelberg (1991)"},{"issue":"2","key":"18_CR15","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01201999","volume":"2","author":"Matthijs 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. In: Computational Complexity, vol.\u00a02, pp. 111\u2013128 (1992)","journal-title":"Computational Complexity"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Dwork, C.: A Public-Key Cryptosystem with Worst-Case\/Average-Case Equivalence. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, STOC, pp. 284\u2013293 (1997)","DOI":"10.1145\/258533.258604"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, STOC, pp. 84\u201393 (2005)","DOI":"10.1145\/1060590.1060603"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Peikert, C.: Public-key cryptosystems from the worst-case shortest vector problem: extended abstract. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC, pp. 333\u2013342 (2009)","DOI":"10.1145\/1536414.1536461"},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"Zhang, W., Wang, B., Hu, Y.: A New Knapsack Public-Key Cryptosystem. In: 2009 International Conference on Information Assurance and Security (IAS), vol.\u00a02, pp. 53\u201356 (2009)","DOI":"10.1109\/IAS.2009.300"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Kobayashi, K., Tadaki, K., Kasahara, M., Tsujii, S.: A knapsack cryptosystem based on multiple knapsacks. In: 2010 International Symposium on Information Theory and its Applications (ISITA), pp. 428\u2013432 (October 2010)","DOI":"10.1109\/ISITA.2010.5649307"},{"key":"18_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/978-3-642-11799-2_23","volume-title":"Theory of Cryptography","author":"V. Lyubashevsky","year":"2010","unstructured":"Lyubashevsky, V., Palacio, A., Segev, G.: Public-Key Cryptographic Primitives Provably as Secure as Subset Sum. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol.\u00a05978, pp. 382\u2013400. Springer, Heidelberg (2010)"},{"key":"18_CR22","unstructured":"Herold, G., Meurer, A.: New Attacks for Knapsack Based Cryptosystems. Full Version, http:\/\/eprint.iacr.org"}],"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-32928-9_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,3]],"date-time":"2019-07-03T02:43:12Z","timestamp":1562121792000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32928-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642329272","9783642329289"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32928-9_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}