{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T22:06:19Z","timestamp":1773525979258,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642103650","type":"print"},{"value":"9783642103667","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10366-7_34","type":"book-chapter","created":{"date-parts":[[2009,12,1]],"date-time":"2009-12-01T03:08:44Z","timestamp":1259636924000},"page":"578-597","source":"Crossref","is-referenced-by-count":76,"title":["Preimages for Step-Reduced SHA-2"],"prefix":"10.1007","author":[{"given":"Kazumaro","family":"Aoki","sequence":"first","affiliation":[]},{"given":"Jian","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Krystian","family":"Matusiewicz","sequence":"additional","affiliation":[]},{"given":"Yu","family":"Sasaki","sequence":"additional","affiliation":[]},{"given":"Lei","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"34_CR1","unstructured":"U.S. Department of Commerce, National Institute of Standards and Technology: Secure Hash Standard (SHS) (Federal Information Processing Standards Publication 180-3) (2008), http:\/\/csrc.nist.gov\/publications\/fips\/fips180-3\/fips180-3_final.pdf"},{"key":"34_CR2","doi-asserted-by":"crossref","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)","DOI":"10.1007\/11535218_2"},{"key":"34_CR3","unstructured":"U.S. Department of Commerce, National Institute of Standards and Technology: Federal Register Vol. 72(212) Friday, November 2, 2007 Notices (2007), http:\/\/csrc.nist.gov\/groups\/ST\/hash\/documents\/FR_Notice_Nov07.pdf"},{"key":"34_CR4","unstructured":"U.S. Department of Commerce, National Institute of Standards and Technology: NIST\u2019s Plan for Handling Tunable Parameters. Presentation by Souradyuti Paul at The First SHA-3 Candidate Conference (February 2009), http:\/\/csrc.nist.gov\/groups\/ST\/hash\/sha-3\/Round1\/Feb2009\/"},{"key":"34_CR5","doi-asserted-by":"crossref","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)","DOI":"10.1007\/11799313_9"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"Nikoli\u0107, I., Biryukov, A.: Collisions for step-reduced SHA-256. In: [25], pp. 1\u201315","DOI":"10.1007\/978-3-540-71039-4_1"},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"Indesteege, S., Mendel, F., Preneel, B., Rechberger, C.: Collisions and other non-random properties for step-reduced SHA-256. In: [26], pp. 276\u2013293","DOI":"10.1007\/978-3-642-04159-4_18"},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"Sanadhya, S.K., Sarkar, P.: New collision attacks against up to 24-step SHA-2 (extended abstract). In: Rijmen, V., Das, A., Chowdhury, D.R. (eds.) INDOCRYPT 2008. LNCS, vol.\u00a05365, pp. 91\u2013103. Springer, Heidelberg (2008)","DOI":"10.1007\/978-3-540-89754-5_8"},{"key":"34_CR9","doi-asserted-by":"crossref","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)","DOI":"10.1007\/978-3-642-03317-9_9"},{"key":"34_CR10","unstructured":"Yu, H., Wang, X.: Non-randomness of 39-step SHA-256 (2008), http:\/\/www.iacr.org\/conferences\/eurocrypt2008v\/index.html"},{"key":"34_CR11","doi-asserted-by":"crossref","unstructured":"Saarinen, M.J.O.: A meet-in-the-middle collision attack against the new FORK-256. In: Srinathan, K., Pandu Rangan, C., Yung, M. (eds.) INDOCRYPT 2007. LNCS, vol.\u00a04859, pp. 10\u201317. Springer, Heidelberg (2007)","DOI":"10.1007\/978-3-540-77026-8_2"},{"key":"34_CR12","doi-asserted-by":"crossref","unstructured":"Leurent, G.: MD4 is not one-way. In: [25], pp. 412\u2013428","DOI":"10.1007\/978-3-540-71039-4_26"},{"key":"34_CR13","doi-asserted-by":"crossref","unstructured":"Rivest, R.L.: Request for Comments 1321: The MD5 Message Digest Algorithm. The Internet Engineering Task Force (1992), http:\/\/www.ietf.org\/rfc\/rfc1321.txt","DOI":"10.17487\/rfc1321"},{"key":"34_CR14","doi-asserted-by":"crossref","unstructured":"Zheng, Y., Pieprzyk, J., Seberry, J.: HAVAL \u2014 one-way hashing algorithm with variable length of output. In: Seberry, J., Zheng, Y. (eds.) AUSCRYPT 1992. LNCS, vol.\u00a0718, pp. 83\u2013104. Springer, Heidelberg (1993)","DOI":"10.1007\/3-540-57220-1_54"},{"key":"34_CR15","doi-asserted-by":"crossref","unstructured":"Aoki, K., Sasaki, Y.: Preimage attacks on one-block MD4, 63-step MD5 and more. In: [26], pp. 103\u2013119","DOI":"10.1007\/978-3-642-04159-4_7"},{"key":"34_CR16","doi-asserted-by":"crossref","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)","DOI":"10.1007\/978-3-642-01001-9_8"},{"key":"34_CR17","doi-asserted-by":"crossref","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)","DOI":"10.1007\/978-3-642-03356-8_5"},{"key":"34_CR18","doi-asserted-by":"crossref","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)","DOI":"10.1007\/978-3-540-89255-7_16"},{"key":"34_CR19","unstructured":"Chang, D., Hong, S., Kang, C., Kang, J., Kim, J., Lee, C., Lee, J., Lee, J., Lee, S., Lee, Y., Lim, J., Sung, J.: ARIRANG. NIST home page: http:\/\/csrc.nist.gov\/groups\/ST\/hash\/sha-3\/Round1\/submissions_rnd1.html"},{"key":"34_CR20","unstructured":"Hong, D., Kim, W.H., Koo, B.: Preimage attack on ARIRANG. Cryptology ePrint Archive, Report 2009\/147 (2009), http:\/\/eprint.iacr.org\/2009\/147"},{"key":"34_CR21","unstructured":"Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of applied cryptography. CRC Press, Boca Raton (1997)"},{"key":"34_CR22","doi-asserted-by":"crossref","unstructured":"Kelsey, J., Schneier, B.: Second preimages on n-bit hash functions for much less than 2 n work. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 474\u2013490. Springer, Heidelberg (2005)","DOI":"10.1007\/11426639_28"},{"key":"34_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/978-3-642-04474-8_7","volume-title":"ISC 2009","author":"Y. Sasaki","year":"2009","unstructured":"Sasaki, Y.: Meet-in-the-middle attacks using output truncation in 3-pass HAVAL. In: Samarati, P., Yung, M., Martinelli, F. (eds.) ISC 2009. LNCS, vol.\u00a05735, pp. 79\u201394. Springer, Heidelberg (2009)"},{"key":"34_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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.\u00a03152, pp. 306\u2013316. Springer, Heidelberg (2004)"},{"key":"34_CR25","series-title":"Lecture Notes in Computer Science","volume-title":"FSE 2008","year":"2008","unstructured":"Nyberg, K. (ed.): FSE 2008. LNCS, vol.\u00a05086. Springer, Heidelberg (2008)"},{"key":"34_CR26","series-title":"Lecture Notes in Computer Science","volume-title":"SAC 2008","year":"2009","unstructured":"Avanzi, R., Keliher, L., Sica, F. (eds.): SAC 2008. LNCS, vol.\u00a05381. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10366-7_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:54:51Z","timestamp":1606186491000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10366-7_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642103650","9783642103667"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10366-7_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}