{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T00:24:34Z","timestamp":1771028674053,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":42,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662467053","type":"print"},{"value":"9783662467060","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-46706-0_24","type":"book-chapter","created":{"date-parts":[[2015,4,18]],"date-time":"2015-04-18T02:15:01Z","timestamp":1429323301000},"page":"473-488","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Branching Heuristics in Differential Collision Search with Applications to SHA-512"],"prefix":"10.1007","author":[{"given":"Maria","family":"Eichlseder","sequence":"first","affiliation":[]},{"given":"Florian","family":"Mendel","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Schl\u00e4ffer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,19]]},"reference":[{"key":"24_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1007\/978-3-642-10366-7_34","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"K Aoki","year":"2009","unstructured":"Aoki, K., Guo, J., Matusiewicz, K., Sasaki, Y., Wang, L.: Preimages for step-reduced SHA-2. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 578\u2013597. Springer, Heidelberg (2009)"},{"key":"24_CR2","unstructured":"Bernstein, D.J., Lange, T.: eBASH: ECRYPT benchmarking of all submitted hashes, January 2011. http:\/\/bench.cr.yp.to\/ebash.html"},{"key":"24_CR3","first-page":"143","volume":"49","author":"M Buro","year":"1993","unstructured":"Buro, M., Kleine-B\u00fcning, H.: Report on a SAT competition. Bull. Eur. Assoc. Theor. Comput. Sci. 49, 143\u2013151 (1993)","journal-title":"Bull. Eur. Assoc. Theor. Comput. Sci."},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science","volume-title":"Fast Software Encryption","year":"2012","unstructured":"Canteaut, A. (ed.): FSE 2012. LNCS, vol. 7549. Springer, Heidelberg (2012)"},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","year":"2005","unstructured":"Cramer, R. (ed.): EUROCRYPT 2005. LNCS, vol. 3494. Springer, Heidelberg (2005)"},{"issue":"7","key":"24_CR6","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M Davis","year":"1962","unstructured":"Davis, M., Logemann, G., Loveland, D.W.: A machine program for theorem-proving. Commun. ACM 5(7), 394\u2013397 (1962)","journal-title":"Commun. ACM"},{"key":"24_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11935230_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2006","author":"C Canni\u00e8re De","year":"2006","unstructured":"De Canni\u00e8re, C., Rechberger, C.: Finding SHA-1 characteristics: general results and applications. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol. 4284, pp. 1\u201320. Springer, Heidelberg (2006)"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible SAT-solver. In: Giunchiglia and Tacchella [11], pp. 502\u2013518","DOI":"10.1007\/978-3-540-24605-3_37"},{"key":"24_CR9","unstructured":"Eichlseder, M., Mendel, F., Nad, T., Rijmen, V., Schl\u00e4ffer, M.: Linear propagation in efficient guess-and-determine attacks. In: Budaghyan, L., Helleseth, T., Parker, M. G. (eds.) WCC (2013). http:\/\/www.selmer.uib.no\/WCC2013\/"},{"key":"24_CR10","unstructured":"Freeman, J.W.: Improvements to propositional satisfiability search algorithms. Ph.D. thesis, Departement of computer and Information science, University of Pennsylvania, Philadelphia (1995)"},{"key":"24_CR11","series-title":"Lecture Notes in Computer Science","volume-title":"Theory and Applications of Satisfiability Testing","year":"2004","unstructured":"Giunchiglia, E., Tacchella, A. (eds.): SAT 2003. LNCS, vol. 2919. Springer, Heidelberg (2004)"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Goldberg, E.I., Novikov, Y.: BerkMin: a fast and robust SAT-solver. In: DATE, pp. 142\u2013149. IEEE Computer Society (2002)","DOI":"10.1109\/DATE.2002.998262"},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"Herbstritt, M., Becker, B.: Conflict-based selection of branching rules. In: Giunchiglia and Tacchella [11], pp. 441\u2013451","DOI":"10.1007\/978-3-540-24605-3_33"},{"issue":"1\u20134","key":"24_CR14","first-page":"47","volume":"2","author":"M Heule","year":"2006","unstructured":"Heule, M., van Maaren, H.: March_dl: adding adaptive heuristics and a new branching strategy. JSAT 2(1\u20134), 47\u201359 (2006)","journal-title":"JSAT"},{"key":"24_CR15","series-title":"Frontiers in Artificial Intelligence and Applications","first-page":"155","volume-title":"Handbook of Satisfiability","author":"M Heule","year":"2009","unstructured":"Heule, M., van Maaren, H.: Look-ahead based SAT solvers. In: Biere, A., van Heule, M., Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol. 185, pp. 155\u2013184. IOS Press, Amsterdam (2009)"},{"key":"24_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-642-04159-4_18","volume-title":"Selected Areas in Cryptography","author":"S Indesteege","year":"2009","unstructured":"Indesteege, S., Mendel, F., Preneel, B., Rechberger, C.: Collisions and other non-random properties for step-reduced SHA-256. In: Avanzi, R.M., Keliher, L., Sica, F. (eds.) SAC 2008. LNCS, vol. 5381, pp. 276\u2013293. Springer, Heidelberg (2009)"},{"key":"24_CR17","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BF01531077","volume":"1","author":"RG Jeroslow","year":"1990","unstructured":"Jeroslow, R.G., Wang, J.: Solving propositional satisfiability problems. Ann. Math. Artif. Intell. 1, 167\u2013187 (1990)","journal-title":"Ann. Math. Artif. Intell."},{"key":"24_CR18","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","year":"2013","unstructured":"Johansson, T., Nguyen, P.Q. (eds.): EUROCRYPT 2013. LNCS, vol. 7881. Springer, Heidelberg (2013)"},{"key":"24_CR19","doi-asserted-by":"crossref","unstructured":"Khovratovich, D., Rechberger, C., Savelieva, A.: Bicliques for preimages: attacks on Skein-512 and the SHA-2 family. In: Canteaut [4], pp. 244\u2013263","DOI":"10.1007\/978-3-642-34047-5_15"},{"key":"24_CR20","doi-asserted-by":"crossref","unstructured":"Landelle, F., Peyrin, T.: Cryptanalysis of full RIPEMD-128. In: Johansson and Nguyen [18], pp. 228\u2013244","DOI":"10.1007\/978-3-642-38348-9_14"},{"key":"24_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-642-34961-4_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"G Leurent","year":"2012","unstructured":"Leurent, G.: Analysis of differential attacks in ARX constructions. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 226\u2013243. Springer, Heidelberg (2012)"},{"key":"24_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-642-40041-4_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"G Leurent","year":"2013","unstructured":"Leurent, G.: Construction of differential characteristics in ARX designs application to skein. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part I. LNCS, vol. 8042, pp. 241\u2013258. Springer, Heidelberg (2013)"},{"key":"24_CR23","unstructured":"Li, C.M., Anbulagan: Heuristics based on unit propagation for satisfiability problems. In: IJCAI, vol. 1, pp. 366\u2013371. Morgan Kaufmann, San Francisco (1997)"},{"key":"24_CR24","doi-asserted-by":"crossref","unstructured":"Li, J., Isobe, T., Shibutani, K.: Converting meet-in-the-middle preimage attack into pseudo collision attack: application to SHA-2. In: Canteaut [4], pp. 264\u2013286","DOI":"10.1007\/978-3-642-34047-5_16"},{"issue":"1\u20132","key":"24_CR25","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/S0004-3702(99)00097-1","volume":"116","author":"P Liberatore","year":"2000","unstructured":"Liberatore, P.: On the complexity of choosing the branching literal in DPLL. Artif. Intell. 116(1\u20132), 315\u2013326 (2000)","journal-title":"Artif. Intell."},{"key":"24_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-642-33383-5_2","volume-title":"Information Security","author":"F Mendel","year":"2012","unstructured":"Mendel, F., Nad, T., Scherz, S., Schl\u00e4ffer, M.: Differential attacks on reduced Ripemd-160. In: Gollmann, D., Freiling, F.C. (eds.) ISC 2012. LNCS, vol. 7483, pp. 23\u201338. Springer, Heidelberg (2012)"},{"key":"24_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/978-3-642-25385-0_16","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"F Mendel","year":"2011","unstructured":"Mendel, F., Nad, T., Schl\u00e4ffer, M.: Finding SHA-2 characteristics: searching through a minefield of contradictions. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 288\u2013307. Springer, Heidelberg (2011)"},{"key":"24_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-642-36095-4_12","volume-title":"Topics in Cryptology \u2013 CT-RSA 2013","author":"F Mendel","year":"2013","unstructured":"Mendel, F., Nad, T., Schl\u00e4ffer, M.: Finding collisions for round-reduced SM3. In: Dawson, E. (ed.) CT-RSA 2013. LNCS, vol. 7779, pp. 174\u2013188. Springer, Heidelberg (2013)"},{"key":"24_CR29","doi-asserted-by":"crossref","unstructured":"Mendel, F., Nad, T., Schl\u00e4ffer, M.: Improving local collisions: new attacks on reduced SHA-256. In: Johansson and Nguyen [18], pp. 262\u2013278","DOI":"10.1007\/978-3-642-38348-9_16"},{"key":"24_CR30","doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient SAT solver. In: DAC, pp. 530\u2013535. ACM (2001)","DOI":"10.1145\/378239.379017"},{"key":"24_CR31","unstructured":"National Institute of Standards and Technology. FIPS PUB 180\u20133: Secure Hash Standard. Federal Information Processing Standards Publication 180\u20133, U.S. Department of Commerce, October 2008. http:\/\/www.itl.nist.gov\/fipspubs"},{"key":"24_CR32","unstructured":"National Institute of Standards and Technology. FIPS PUB 180\u20134: Secure Hash Standard. Federal Information Processing Standards Publication 180\u20134, U.S. Department of Commerce, March 2012. http:\/\/www.itl.nist.gov\/fipspubs"},{"key":"24_CR33","unstructured":"National Institute of Standards and Technology. SHA-3 Selection Announcement, October 2012. http:\/\/csrc.nist.gov\/groups\/ST\/hash\/sha-3\/sha-3_selection_announcement.pdf"},{"key":"24_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-71039-4_1","volume-title":"Fast Software Encryption","author":"I Nikoli\u0107","year":"2008","unstructured":"Nikoli\u0107, I., Biryukov, A.: Collisions for step-reduced SHA-256. In: Nyberg, K. (ed.) FSE 2008. LNCS, vol. 5086, pp. 1\u201315. Springer, Heidelberg (2008)"},{"issue":"1\u20133","key":"24_CR35","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0166-218X(98)00045-6","volume":"89","author":"M Ouyang","year":"1998","unstructured":"Ouyang, M.: How good are branching rules in DPLL? Discrete Appl. Math. 89(1\u20133), 281\u2013286 (1998)","journal-title":"Discrete Appl. Math."},{"key":"24_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-540-89754-5_8","volume-title":"Progress in Cryptology - INDOCRYPT 2008","author":"SK Sanadhya","year":"2008","unstructured":"Sanadhya, S.K., Sarkar, P.: New collision attacks against up to 24-step SHA-2. In: Chowdhury, D.R., Rijmen, V., Das, A. (eds.) INDOCRYPT 2008. LNCS, vol. 5365, pp. 91\u2013103. Springer, Heidelberg (2008)"},{"key":"24_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/11799313_16","volume-title":"Fast Software Encryption","author":"M Schl\u00e4ffer","year":"2006","unstructured":"Schl\u00e4ffer, M., Oswald, E.: Searching for differential paths in MD4. In: Robshaw, M. (ed.) FSE 2006. LNCS, vol. 4047, pp. 242\u2013261. Springer, Heidelberg (2006)"},{"key":"24_CR38","unstructured":"Shay Gueron, J.W., Johnson, S.: SHA-512\/256. Cryptology ePrint Archive, Report 2010\/548 (2010). http:\/\/eprint.iacr.org\/"},{"key":"24_CR39","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/3-540-48159-1_5","volume-title":"Progress in Artificial Intelligence","author":"J Marques-Silva","year":"1999","unstructured":"Marques-Silva, J.: The impact of branching heuristics in propositional satisfiability algorithms. In: Barahona, P., Alferes, J.J. (eds.) EPIA 1999. LNCS (LNAI), vol. 1695, pp. 62\u201374. Springer, Heidelberg (1999)"},{"key":"24_CR40","doi-asserted-by":"crossref","unstructured":"Wang, X., Lai, X., Feng, D., Chen, H., Yu, X.: Cryptanalysis of the hash functions MD4 and RIPEMD. In: Cramer [5], pp. 1\u201318","DOI":"10.1007\/11426639_1"},{"key":"24_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/11535218_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"X Wang","year":"2005","unstructured":"Wang, X., Yin, Y.L., Yu, H.: Finding collisions in the full SHA-1. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 17\u201336. Springer, Heidelberg (2005)"},{"key":"24_CR42","doi-asserted-by":"crossref","unstructured":"Wang, X., Yu, H.: How to break MD5 and other hash functions. In: Cramer [5], pp. 19\u201335","DOI":"10.1007\/11426639_2"}],"container-title":["Lecture Notes in Computer Science","Fast Software Encryption"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-46706-0_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T18:28:29Z","timestamp":1747938509000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-46706-0_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662467053","9783662467060"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-46706-0_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"19 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}