{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:54:13Z","timestamp":1725515653642},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540707592"},{"type":"electronic","value":"9783540707608"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70760-8_9","type":"book-chapter","created":{"date-parts":[[2008,7,14]],"date-time":"2008-07-14T22:32:23Z","timestamp":1216074743000},"page":"107-118","source":"Crossref","is-referenced-by-count":0,"title":["Proposals for Iterated Hash Functions"],"prefix":"10.1007","author":[{"given":"Lars R.","family":"Knudsen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00f8ren S.","family":"Thomsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I.: A Design Principle for Hash Functions. In: [19], pp. 416\u2013427.","DOI":"10.1007\/0-387-34805-0_39"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Merkle, R.C.: One Way Hash Functions and DES. In: [19], pp. 428\u2013446.","DOI":"10.1007\/0-387-34805-0_40"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Wang, X., Yu, H.: How to Break MD5 and Other Hash Functions. In: [20], pp. 19\u201335.","DOI":"10.1007\/11426639_2"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Biham, E., Chen, R., Joux, A., Carribault, P., Lemuet, C., Jalby, W.: Collisions of SHA-0 and Reduced SHA-1. In: [20], pp. 36\u201357.","DOI":"10.1007\/11426639_3"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","first-page":"17","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":"9_CR6","unstructured":"FIPS 180-1, Secure Hash Standard. Federal Information Processing Standards Publication 180-1, U.S. Department of Commerce\/NIST, National Technical Information Service, Springfield, Virginia. Supersedes FIPS 180 (1995)"},{"key":"9_CR7","unstructured":"FIPS 180-2, Secure Hash Standard. Federal Information Processing Standards Publication 180-2, U.S. Department of Commerce\/NIST, National Technical Information Service, Springfield, Virginia. Supersedes FIPS 180 and FIPS 180-1 (2002)"},{"key":"9_CR8","unstructured":"Preneel, B.: Analysis and Design of Cryptographic Hash Functions. PhD thesis, Katholieke Universiteit Leuven (1993)"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/3-540-45353-9_7","volume-title":"Topics in Cryptology - CT-RSA 2001","author":"H. Handschuh","year":"2001","unstructured":"Handschuh, H., Knudsen, L., Robshaw, M.: Analysis of SHA-1 in Encryption Mode. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol.\u00a02020, pp. 70\u201383. Springer, Heidelberg (2001)"},{"key":"9_CR10","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":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/11761679_12","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"J. Kelsey","year":"2006","unstructured":"Kelsey, J., Kohno, T.: Herding Hash Functions and the Nostradamus Attack. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 183\u2013200. Springer, Heidelberg (2006)"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Kelsey, J., Schneier, B.: Second Preimages on n-bit Hash Functions for Much Less than 2n Work. In: [20], pp. 474\u2013490.","DOI":"10.1007\/11426639_28"},{"key":"9_CR13","volume-title":"Practical Cryptography","author":"N. Ferguson","year":"2003","unstructured":"Ferguson, N., Schneier, B.: Practical Cryptography. Wiley Publishing, Chichester (2003)"},{"key":"9_CR14","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)"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/11780656_34","volume-title":"Information Security and Privacy","author":"P. Gauravaram","year":"2006","unstructured":"Gauravaram, P., Millan, W., Dawson, E., Viswanathan, K.: Constructing Secure Hash Functions by Enhancing Merkle-Damg\u00e5rd Construction. In: Batten, L.M., Safavi-Naini, R. (eds.) ACISP 2006. LNCS, vol.\u00a04058, pp. 407\u2013420. Springer, Heidelberg (2006)"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Kaliski, B.: RFC 1319, The MD2 Message-Digest Algorithm. Internet Request for Comments 1319 (1992)","DOI":"10.17487\/rfc1319"},{"key":"9_CR17","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":"9_CR18","unstructured":"Rivest, R.L.: Abelian square-free dithering for iterated hash functions. In: NIST Cryptographic Hash Workshop (November 2005). retrieved from http:\/\/theory.lcs.mit.edu\/~rivest\/"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - CRYPTO \u201989","year":"1990","unstructured":"Brassard, G. (ed.): CRYPTO 1989. LNCS, vol.\u00a0435. Springer, Heidelberg (1990)"},{"key":"9_CR20","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.\u00a03494. Springer, Heidelberg (2005)"}],"container-title":["Communications in Computer and Information Science","E-Business and Telecommunication Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70760-8_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T00:27:52Z","timestamp":1620001672000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70760-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540707592","9783540707608"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70760-8_9","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[]}}