{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:04:36Z","timestamp":1786979076907,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642340468","type":"print"},{"value":"9783642340475","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-34047-5_16","type":"book-chapter","created":{"date-parts":[[2012,9,10]],"date-time":"2012-09-10T06:56:19Z","timestamp":1347260179000},"page":"264-286","source":"Crossref","is-referenced-by-count":25,"title":["Converting Meet-In-The-Middle Preimage Attack into Pseudo Collision Attack: Application to SHA-2"],"prefix":"10.1007","author":[{"given":"Ji","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Takanori","family":"Isobe","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kyoji","family":"Shibutani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/3-540-60865-6_46","volume-title":"Fast Software Encryption","author":"R.J. Anderson","year":"1996","unstructured":"Anderson, R.J., Biham, E.: Tiger: A Fast New Hash Function. In: Gollmann, D. (ed.) FSE 1996. LNCS, vol.\u00a01039, pp. 89\u201397. Springer, Heidelberg (1996)"},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-642-04159-4_7","volume-title":"Selected Areas in Cryptography","author":"K. Aoki","year":"2009","unstructured":"Aoki, K., Sasaki, Y.: Preimage Attacks on One-Block MD4, 63-Step MD5 and More. In: Avanzi, R.M., Keliher, L., Sica, F. (eds.) SAC 2008. LNCS, vol.\u00a05381, pp. 103\u2013119. Springer, Heidelberg (2009)"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-642-03356-8_5","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"K. Aoki","year":"2009","unstructured":"Aoki, K., Sasaki, Y.: Meet-in-the-Middle Preimage Attacks Against Reduced SHA-0 and SHA-1. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, pp. 70\u201389. Springer, Heidelberg (2009)"},{"key":"16_CR4","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.\u00a05912, pp. 578\u2013597. Springer, Heidelberg (2009)"},{"key":"16_CR5","unstructured":"Aumasson, J.-P., Henzen, L., Meier, W., Phan, R.C.-W.: SHA-3 proposal BLAKE (version 1.3). Submission to NIST (December 2010), \n                    \n                      http:\/\/131002.net\/blake\/blake.pdf"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1007\/978-3-642-25385-0_15","volume-title":"ASIACRYPT","author":"A. Biryukov","year":"2011","unstructured":"Biryukov, A., Lamberger, M., Mendel, F., Nikoli\u0107, I.: Second-Order Differential Collisions for Reduced SHA-256. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol.\u00a07073, pp. 270\u2013287. Springer, Heidelberg (2011)"},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-642-19574-7_16","volume-title":"Selected Areas in Cryptography","author":"A. Bogdanov","year":"2011","unstructured":"Bogdanov, A., Rechberger, C.: A 3-Subset Meet-in-the-Middle Attack: Cryptanalysis of the Lightweight Block Cipher KTANTAN. In: Biryukov, A., Gong, G., Stinson, D.R. (eds.) SAC 2010. LNCS, vol.\u00a06544, pp. 229\u2013240. Springer, Heidelberg (2011)"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-540-85174-5_11","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"C. Canni\u00e8re De","year":"2008","unstructured":"De Canni\u00e8re, C., Rechberger, C.: Preimages for Reduced SHA-0 and SHA-1. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 179\u2013202. Springer, Heidelberg (2008)"},{"key":"16_CR9","unstructured":"Ferguson, N., Lucks, S., Schneier, B., Whiting, D., Bellare, M., Kohno, T., Callas, J., Walker, J.: The Skein hash function family (version 1.3, October 1, 2010), \n                    \n                      http:\/\/www.schneier.com\/skein1.3.pdf"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-642-17373-8_4","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"J. Guo","year":"2010","unstructured":"Guo, J., Ling, S., Rechberger, C., Wang, H.: Advanced Meet-in-the-Middle Preimage Attacks: First Results on Full Tiger, and Improved Results on MD4 and SHA-2. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol.\u00a06477, pp. 56\u201375. Springer, Heidelberg (2010)"},{"key":"16_CR11","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.\u00a05381, pp. 276\u2013293. Springer, Heidelberg (2009)"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/978-3-642-21702-9_17","volume-title":"Fast Software Encryption","author":"T. Isobe","year":"2011","unstructured":"Isobe, T.: A Single-Key Attack on the Full GOST Block Cipher. In: Joux, A. (ed.) FSE 2011. LNCS, vol.\u00a06733, pp. 290\u2013305. Springer, Heidelberg (2011)"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-642-03317-9_9","volume-title":"Fast Software Encryption","author":"T. Isobe","year":"2009","unstructured":"Isobe, T., Shibutani, K.: Preimage Attacks on Reduced Tiger and SHA-2. In: Dunkelman, O. (ed.) FSE 2009. LNCS, vol.\u00a05665, pp. 139\u2013155. Springer, Heidelberg (2009)"},{"key":"16_CR14","series-title":"LNCS","first-page":"244","volume-title":"FSE 2012","author":"D. Khovratovich","year":"2012","unstructured":"Khovratovich, D., Rechberger, C., Savelieva, A.: Bicliques for Preimages: Attacks on Skein-512 and the SHA-2 Family. In: Canteaut, A. (ed.) FSE 2012. LNCS, vol.\u00a07549, pp. 244\u2013263. Springer, Heidelberg (2012)"},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/3-540-47555-9_5","volume-title":"Advances in Cryptology - EUROCRYPT \u201992","author":"X. Lai","year":"1993","unstructured":"Lai, X., Massey, J.L.: Hash Functions Based on Block Ciphers. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol.\u00a0658, pp. 55\u201370. Springer, Heidelberg (1993)"},{"key":"16_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/978-3-540-71039-4_26","volume-title":"Fast Software Encryption","author":"G. Leurent","year":"2008","unstructured":"Leurent, G.: MD4 is Not One-Way. In: Nyberg, K. (ed.) FSE 2008. LNCS, vol.\u00a05086, pp. 412\u2013428. Springer, Heidelberg (2008)"},{"key":"16_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1007\/978-3-642-25385-0_16","volume-title":"ASIACRYPT","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.\u00a07073, pp. 288\u2013307. Springer, Heidelberg (2011)"},{"key":"16_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/11799313_9","volume-title":"Fast Software Encryption","author":"F. Mendel","year":"2006","unstructured":"Mendel, F., Pramstaller, N., Rechberger, C., Rijmen, V.: Analysis of Step-Reduced SHA-256. In: Robshaw, M.J.B. (ed.) FSE 2006. LNCS, vol.\u00a04047, pp. 126\u2013143. Springer, Heidelberg (2006)"},{"key":"16_CR19","unstructured":"Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press (1997)"},{"key":"16_CR20","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.\u00a05086, pp. 1\u201315. Springer, Heidelberg (2008)"},{"key":"16_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/3-540-46885-4_43","volume-title":"Advances in Cryptology - EUROCRYPT \u201989","author":"J.-J. Quisquater","year":"1990","unstructured":"Quisquater, J.-J., Delescaille, J.-P.: How Easy Is Collision Search? Application to DES (Extended Summary). In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol.\u00a0434, pp. 429\u2013434. Springer, Heidelberg (1990)"},{"key":"16_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/978-3-540-77026-8_2","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2007","author":"M.-J.O. Saarinen","year":"2007","unstructured":"Saarinen, M.-J.O.: A Meet-in-the-Middle Collision Attack Against the New FORK-256. In: Srinathan, K., Rangan, C.P., Yung, M. (eds.) INDOCRYPT 2007. LNCS, vol.\u00a04859, pp. 10\u201317. Springer, Heidelberg (2007)"},{"key":"16_CR23","unstructured":"Sanadhya, S.K., Sarkar, P.: 22-step collisions for SHA-2. CoRR, abs\/0803.1220 (2008)"},{"key":"16_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-540-68914-0_8","volume-title":"Applied Cryptography and Network Security","author":"S.K. Sanadhya","year":"2008","unstructured":"Sanadhya, S.K., Sarkar, P.: Attacking Reduced Round SHA-256. In: Bellovin, S.M., Gennaro, R., Keromytis, A.D., Yung, M. (eds.) ACNS 2008. LNCS, vol.\u00a05037, pp. 130\u2013143. Springer, Heidelberg (2008)"},{"key":"16_CR25","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":"S.K. 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.\u00a05365, pp. 91\u2013103. Springer, Heidelberg (2008)"},{"key":"16_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-540-70500-0_19","volume-title":"Information Security and Privacy","author":"S.K. Sanadhya","year":"2008","unstructured":"Sanadhya, S.K., Sarkar, P.: Non-linear Reduced Round Attacks against SHA-2 Hash Family. In: Mu, Y., Susilo, W., Seberry, J. (eds.) ACISP 2008. LNCS, vol.\u00a05107, pp. 254\u2013266. Springer, Heidelberg (2008)"},{"key":"16_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-642-01001-9_8","volume-title":"Advances in Cryptology - EUROCRYPT 2009","author":"Y. Sasaki","year":"2009","unstructured":"Sasaki, Y., Aoki, K.: Finding Preimages in Full MD5 Faster Than Exhaustive Search. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol.\u00a05479, pp. 134\u2013152. Springer, Heidelberg (2009)"},{"key":"16_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-540-89255-7_16","volume-title":"Advances in Cryptology - ASIACRYPT 2008","author":"Y. Sasaki","year":"2008","unstructured":"Sasaki, Y., Aoki, K.: Preimage Attacks on 3, 4, and 5-Pass HAVAL. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol.\u00a05350, pp. 253\u2013271. Springer, Heidelberg (2008)"},{"issue":"2","key":"16_CR29","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1137\/0211030","volume":"11","author":"R. Sedgewick","year":"1982","unstructured":"Sedgewick, R., Szymanski, T.G., Yao, A.C.-C.: The complexity of finding cycles in periodic functions. SIAM J. Comput.\u00a011(2), 376\u2013390 (1982)","journal-title":"SIAM J. Comput."},{"key":"16_CR30","unstructured":"Wang, L., Ohta, K., Sakiyama, K.: Free-start preimages of round-reduced Blake compression function. Rump session at ASIACRYPT 2009 (2009)"},{"key":"16_CR31","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.\u00a03621, pp. 17\u201336. Springer, Heidelberg (2005)"},{"key":"16_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/11426639_2","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"X. Wang","year":"2005","unstructured":"Wang, X., Yu, H.: How to Break MD5 and Other Hash Functions. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 19\u201335. Springer, Heidelberg (2005)"},{"key":"16_CR33","unstructured":"Watanabe, D.: OFFICIAL COMMENT: LUX. NIST mailing list (2009), \n                    \n                      http:\/\/csrc.nist.gov\/groups\/ST\/hash\/sha-3\/Round1\/documents\/LUX_Comments.pdf"}],"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-642-34047-5_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T21:31:00Z","timestamp":1558301460000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34047-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642340468","9783642340475"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34047-5_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}