{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T11:15:19Z","timestamp":1778152519114,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540365976","type":"print"},{"value":"9783540365983","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11799313_14","type":"book-chapter","created":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T10:02:13Z","timestamp":1160042533000},"page":"210-225","source":"Crossref","is-referenced-by-count":108,"title":["Some Plausible Constructions of Double-Block-Length Hash Functions"],"prefix":"10.1007","author":[{"given":"Shoichi","family":"Hirose","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Black, J.: The ideal-cipher model, revisited: An uninstantiable blockcipher-based hash function. Cryptology ePrint Archive, Report 2005\/210 (2005), http:\/\/eprint.iacr.org\/ , (Also appear in this proceedings)","DOI":"10.1007\/11799313_21"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1007\/11426639_31","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"J. Black","year":"2005","unstructured":"Black, J., Cochran, M., Shrimpton, T.: On the impossibility of highly efficient blockcipher-based hash functions. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 526\u2013541. Springer, Heidelberg (2005)"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/3-540-45708-9_21","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"J. Black","year":"2002","unstructured":"Black, J., Rogaway, P., Shrimpton, T.: Black-box analysis of the block-cipherbased hash-function onstructions from PGV. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 320\u2013335. Springer, Heidelberg (2002)"},{"key":"14_CR4","unstructured":"Brachtl, B.O., Coppersmith, D., Hyden, M.M., Matyas Jr., S.M., Meyer, C.H.W., Oseas, J., Pilpel, S., Schilling, M.: Data authentication using modification detection codes based on a public one-way encryption function, U. S. Patent # 4,908,861 (march 1990)"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1007\/11535218_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"J.-S. Coron","year":"2005","unstructured":"Coron, J.-S., Dodis, Y., Malinaud, C., Puniya, P.: Merkle-damg\u00e5rd revisited: How to construct a hash function. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 430\u2013448. Springer, Heidelberg (2005)"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/3-540-39118-5_19","volume-title":"Advances in Cryptology - EUROCRYPT \u201987","author":"I. Damg\u00e5rd","year":"1988","unstructured":"Damg\u00e5rd, I.: Collision free hash functions and public key signature schemes. In: Price, W.L., Chaum, D. (eds.) EUROCRYPT 1987. LNCS, vol.\u00a0304, pp. 203\u2013216. Springer, Heidelberg (1988)"},{"key":"14_CR7","unstructured":"Gauravaram, P., Millan, W., May, L.: CRUSH: A new cryptographic hash function using iterated halving technique. In: Proceedings of Cryptographic Algorithms and their Uses 2004, pp. 28\u201339 (2004)"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/978-3-540-40974-8_23","volume-title":"Cryptography and Coding","author":"M. Hattori","year":"2003","unstructured":"Hattori, M., Hirose, S., Yoshida, S.: Analysis of double block length hash functions. In: Paterson, K.G. (ed.) Cryptography and Coding 2003. LNCS, vol.\u00a02898, pp. 290\u2013302. Springer, Heidelberg (2003)"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/3-540-36492-7_22","volume-title":"Selected Areas in Cryptography","author":"S. Hirose","year":"2003","unstructured":"Hirose, S.: Secure block ciphers are not sufficient for one-way hash functions in the Preneel-Govaerts-Vandewalle model. In: Nyberg, K., Heys, H.M. (eds.) SAC 2002. LNCS, vol.\u00a02595, pp. 339\u2013352. Springer, Heidelberg (2003)"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/11496618_24","volume-title":"Information Security and Cryptology \u2013 ICISC 2004","author":"S. Hirose","year":"2005","unstructured":"Hirose, S.: Provably secure double-block-length hash functions in a black-box model. In: Park, C.-s., Chee, S. (eds.) ICISC 2004. LNCS, vol.\u00a03506, pp. 330\u2013342. Springer, Heidelberg (2005)"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/3-540-48329-2_32","volume-title":"Advances in Cryptology - CRYPTO \u201993","author":"W. Hohl","year":"1994","unstructured":"Hohl, W., Lai, X., Meier, T., Waldvogel, C.: Security of iterated hash functions based on block ciphers. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol.\u00a0773, pp. 379\u2013390. Springer, Heidelberg (1994)"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/11593447_25","volume-title":"Advances in Cryptology - ASIACRYPT 2005","author":"L. Knudsen","year":"2005","unstructured":"Knudsen, L., Muller, F.: Some attacks against a double length hash proposal. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol.\u00a03788, pp. 462\u2013473. Springer, Heidelberg (2005)"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BFb0034837","volume-title":"Advances in Cryptology - ASIACRYPT \u201996","author":"L. Knudsen","year":"1996","unstructured":"Knudsen, L., Preneel, B.: Hash functions based on block ciphers and quaternary codes. In: Kim, K.-c., Matsumoto, T. (eds.) ASIACRYPT 1996. LNCS, vol.\u00a01163, pp. 77\u201390. Springer, Heidelberg (1996)"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/BFb0052257","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"L. Knudsen","year":"1997","unstructured":"Knudsen, L., Preneel, B.: Fast and secure hashing based on codes. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 485\u2013498. Springer, Heidelberg (1997)"},{"issue":"9","key":"14_CR15","doi-asserted-by":"publisher","first-page":"2524","DOI":"10.1109\/TIT.2002.801402","volume":"48","author":"L. Knudsen","year":"2002","unstructured":"Knudsen, L., Preneel, B.: Construction of secure and fast hash functions using nonbinary error-correcting codes. IEEE Transactions on Information Theory\u00a048(9), 2524\u20132539 (2002)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"14_CR16","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s001459900035","volume":"11","author":"L.R. Knudsen","year":"1998","unstructured":"Knudsen, L.R., Lai, X., Preneel, B.: Attacks on fast doble block length hash functions. Journal of Cryptology\u00a011(1), 59\u201372 (1998)","journal-title":"Journal of Cryptology"},{"key":"14_CR17","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 function based on block ciphers. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol.\u00a0658, pp. 55\u201370. Springer, Heidelberg (1993)"},{"key":"14_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1007\/11593447_26","volume-title":"Advances in Cryptology - ASIACRYPT 2005","author":"S. Lucks","year":"2005","unstructured":"Lucks, S.: A failure-friendly design principle for hash functions. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol.\u00a03788, pp. 474\u2013494. Springer, Heidelberg (2005)"},{"key":"14_CR19","doi-asserted-by":"publisher","DOI":"10.1201\/9781439821916","volume-title":"Handbook of Applied Cryptography","author":"A.J. Menezes","year":"1996","unstructured":"Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1996)"},{"key":"14_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1007\/0-387-34805-0_40","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"R.C. Merkle","year":"1990","unstructured":"Merkle, R.C.: One way hash functions and DES. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 428\u2013446. Springer, Heidelberg (1990)"},{"key":"14_CR21","unstructured":"Nandi, M.: Design of Iteration on Hash Functions and Its Cryptanalysis. PhD thesis, Indian Statistical Institute (2005)"},{"key":"14_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/11596219_7","volume-title":"Progress in Cryptology - INDOCRYPT 2005","author":"M. Nandi","year":"2005","unstructured":"Nandi, M.: Towards optimal double-length hash functions. In: Maitra, S., Veni Madhavan, C.E., Venkatesan, R. (eds.) INDOCRYPT 2005. LNCS, vol.\u00a03797, pp. 77\u201389. Springer, Heidelberg (2005)"},{"key":"14_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/11502760_16","volume-title":"Fast Software Encryption","author":"M. Nandi","year":"2005","unstructured":"Nandi, M., Lee, W., Sakurai, K., Lee, S.: Security analysis of a 2\/3-rate double length compression function in the black-box model. In: Gilbert, H., Handschuh, H. (eds.) FSE 2005. LNCS, vol.\u00a03557, pp. 243\u2013254. Springer, Heidelberg (2005)"},{"key":"14_CR24","unstructured":"Pramstaller, N., Rijmen, V.: A collision attack on a double-block-length hash proposal. Cryptology ePrint Archive, Report 2006\/116 (2006), http:\/\/eprint.iacr.org\/"},{"key":"14_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1007\/3-540-48329-2_31","volume-title":"Advances in Cryptology - CRYPTO \u201993","author":"B. Preneel","year":"1994","unstructured":"Preneel, B., Govaerts, R., Vandewalle, J.: Hash functions based on block ciphers: A synthetic approach. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol.\u00a0773, pp. 368\u2013378. Springer, Heidelberg (1994)"},{"issue":"1","key":"14_CR26","first-page":"55","volume":"82","author":"T. Satoh","year":"1999","unstructured":"Satoh, T., Haga, M., Kurosawa, K.: Towards secure and fast hash functions. IEICE Transactions on Fundamentals\u00a0E82-A(1), 55\u201362 (1999)","journal-title":"IEICE Transactions on Fundamentals"}],"container-title":["Lecture Notes in Computer Science","Fast Software Encryption"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11799313_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,9]],"date-time":"2023-05-09T00:34:18Z","timestamp":1683592458000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11799313_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540365976","9783540365983"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/11799313_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}