{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,24]],"date-time":"2026-09-24T14:50:12Z","timestamp":1790261412471,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642320088","type":"print"},{"value":"9783642320095","type":"electronic"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32009-5_42","type":"book-chapter","created":{"date-parts":[[2012,8,6]],"date-time":"2012-08-06T02:40:28Z","timestamp":1344220828000},"page":"719-740","source":"Crossref","is-referenced-by-count":61,"title":["Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems"],"prefix":"10.1007","author":[{"given":"Itai","family":"Dinur","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Orr","family":"Dunkelman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nathan","family":"Keller","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Adi","family":"Shamir","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"42_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-642-20465-4_21","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"A Becker","year":"2011","unstructured":"Becker, A., Coron, J.-S., Joux, A.: Improved Generic Algorithms for Hard Knapsacks. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 364\u2013385. Springer, Heidelberg (2011)"},{"key":"42_CR2","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"M Bellare","year":"1996","unstructured":"Bellare, M., Canetti, R., Krawczyk, H.: Keying Hash Functions for Message Authentication. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 1\u201315. Springer, Heidelberg (1996)"},{"key":"#cr-split#-42_CR3.1","unstructured":"Dinur, I., Dunkelman, O., Shamir, A.: Improved Attacks on Full GOST. In: Fast Software Encryption 2012. LNCS (to appear, 2012)"},{"key":"#cr-split#-42_CR3.2","unstructured":"Available as IACR ePrint report 2011\/558"},{"key":"42_CR4","doi-asserted-by":"crossref","unstructured":"Dinur, I., Dunkelman, O., Keller, N., Shamir, A.: Efficient Dissection of Composite\nProblems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial\nSearch Problems. Cryptology ePrint Archive, Report 2012\/217 (2012)","DOI":"10.1007\/978-3-642-32009-5_42"},{"issue":"4","key":"42_CR5","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1109\/TIT.1980.1056220","volume":"26","author":"ME Hellman","year":"1980","unstructured":"Hellman, M.E.: A Cryptanalytic Time-Memory Tradeoff. IEEE Transactions on Information Theory 26(4), 401\u2013406 (1980)","journal-title":"IEEE Transactions on Information Theory"},{"key":"42_CR6","doi-asserted-by":"crossref","unstructured":"Fiat, A., Moses, S., Shamir, A., Shimshoni, I., Tardos, G.: Planning and Learning\nin Permutation Groups. In: Foundations of Computer Science 1989, pp. 274\u2013279. IEEE Computer Society (1989)","DOI":"10.1109\/SFCS.1989.63490"},{"key":"42_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-642-13190-5_12","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"N Howgrave-Graham","year":"2010","unstructured":"Howgrave-Graham, N., Joux, A.: New Generic Algorithms for Hard Knapsacks. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 235\u2013256. Springer, Heidelberg (2010)"},{"key":"42_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1007\/0-387-34805-0_38","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"J-J Quisquater","year":"1990","unstructured":"Quisquater, J.-J., Delescaille, J.-P.: How Easy Is Collision Search. New Results and\nApplications to DES. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 408\u2013413. Springer, Heidelberg (1990)"},{"key":"42_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/978-3-540-28628-8_19","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"A Joux","year":"2004","unstructured":"Joux, A.: Multicollisions in Iterated Hash Functions. Application to Cascaded Constructions. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 306\u2013316. Springer, Heidelberg (2004)"},{"key":"42_CR10","unstructured":"Knuth, D.: The Art of Computer Programming, 2nd edn., vol. 2, p. 7. Addison-\nWesley (1981)"},{"key":"42_CR11","unstructured":"Korf, R.E.: Finding Optimal Solutions to Rubik\u2019s Cube Using Pattern Databases. In: Proceedings of the Fourteenth National Conference on Artificial Intelligence and Ninth Innovative Applications of Artificial Intelligence Conference, AAAI 1997, IAAI 1997, pp. 700\u2013705. The MIT Press (1997)"},{"key":"42_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/3-540-69710-1_16","volume-title":"Fast Software Encryption","author":"S Lucks","year":"1998","unstructured":"Lucks, S.: Attacking Triple Encryption. In: Vaudenay, S. (ed.) FSE 1998. LNCS, vol. 1372, pp. 239\u2013253. Springer, Heidelberg (1998)"},{"key":"42_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-642-03317-9_16","volume-title":"Fast Software Encryption","author":"F Mendel","year":"2009","unstructured":"Mendel, F., Rechberger, C., Schl\u00e4ffer, M., Thomsen, S.S.: The Rebound Attack:\nCryptanalysis of Reduced Whirlpool and Gr\u00f8stl. In: Dunkelman, O. (ed.) FSE 2009. LNCS, vol. 5665, pp. 260\u2013276. Springer, Heidelberg (2009)"},{"issue":"7","key":"42_CR14","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1145\/358699.358718","volume":"24","author":"RC Merkle","year":"1981","unstructured":"Merkle, R.C., Hellman, M.E.: On the Security of Multiple Encryption. Commun. ACM 24(7), 465\u2013467 (1981)","journal-title":"Commun. ACM"},{"key":"42_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-642-22792-9_11","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"M Naya-Plasencia","year":"2011","unstructured":"Naya-Plasencia, M.: How to Improve Rebound Attacks. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 188\u2013205. Springer, Heidelberg (2011)"},{"issue":"3","key":"42_CR16","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.ipl.2004.01.016","volume":"90","author":"G Nivasch","year":"2004","unstructured":"Nivasch, G.: Cycle Detection Using a Stack. Inf. Process. Lett. 90(3), 135\u2013140 (2004)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"42_CR17","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1137\/0210033","volume":"10","author":"R Schroeppel","year":"1981","unstructured":"Schroeppel, R., Shamir, A.: A \n                  \n                    \n                  \n                  $${\\text{ T }}=O(2^{n\/2}), {\\text{ S }}=O(2^{n\/4})$$\n                 Algorithm for Certain NPComplete\nProblems. SIAM J. Comput. 10(3), 456\u2013464 (1981)","journal-title":"SIAM J. Comput."},{"key":"42_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/3-540-68697-5_18","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"PC Oorschot van","year":"1996","unstructured":"van Oorschot, P.C., Wiener, M.J.: Improving Implementable Meet-in-the-Middle\nAttacks by Orders of Magnitude. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 229\u2013236. Springer, Heidelberg (1996)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32009-5_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,6]],"date-time":"2019-05-06T18:51:27Z","timestamp":1557168687000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32009-5_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642320088","9783642320095"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32009-5_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}