{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T11:51:22Z","timestamp":1769514682273,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540789666","type":"print"},{"value":"9783540789673","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78967-3_16","type":"book-chapter","created":{"date-parts":[[2008,4,4]],"date-time":"2008-04-04T04:11:30Z","timestamp":1207282290000},"page":"270-288","source":"Crossref","is-referenced-by-count":39,"title":["Second Preimage Attacks on Dithered Hash Functions"],"prefix":"10.1007","author":[{"given":"Elena","family":"Andreeva","sequence":"first","affiliation":[]},{"given":"Charles","family":"Bouillaguet","sequence":"additional","affiliation":[]},{"given":"Pierre-Alain","family":"Fouque","sequence":"additional","affiliation":[]},{"given":"Jonathan J.","family":"Hoch","sequence":"additional","affiliation":[]},{"given":"John","family":"Kelsey","sequence":"additional","affiliation":[]},{"given":"Adi","family":"Shamir","sequence":"additional","affiliation":[]},{"given":"Sebastien","family":"Zimmer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"crossref","first-page":"133","DOI":"10.36045\/bbms\/1103408543","volume":"1","author":"J.-P. Allouche","year":"1994","unstructured":"Allouche, J.-P.: Sur la complexit\u00e9 des suites infinies. Bull. Belg. Math. Soc.\u00a01, 133\u2013143 (1994)","journal-title":"Bull. Belg. Math. Soc."},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-540-76900-2_8","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","author":"E. Andreeva","year":"2007","unstructured":"Andreeva, E., Neven, G., Preneel, B., Shrimpton, T.: Seven-Property-Preserving Iterated Hashing: ROX. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol.\u00a04833, pp. 130\u2013146. Springer, Heidelberg (2007)"},{"key":"16_CR3","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: [16], pp. 36\u201357","DOI":"10.1007\/11426639_3"},{"key":"16_CR4","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)"},{"issue":"3","key":"16_CR5","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/BF01706087","volume":"6","author":"A. Cobham","year":"1972","unstructured":"Cobham, A.: Uniform tag seqences. Mathematical Systems Theory\u00a06(3), 164\u2013192 (1972)","journal-title":"Mathematical Systems Theory"},{"key":"16_CR6","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)"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I.: A Design Principle for Hash Functions. In: [4], pp. 416\u2013427","DOI":"10.1007\/0-387-34805-0_39"},{"key":"16_CR8","unstructured":"Dean, R.D.: Formal Aspects of Mobile Code Security. PhD thesis, Princeton University (January 1999)"},{"issue":"1","key":"16_CR9","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0304-3975(75)90012-2","volume":"1","author":"A. Ehrenfeucht","year":"1975","unstructured":"Ehrenfeucht, A., Lee, K.P., Rozenberg, G.: Subword Complexities of Various Classes of Deterministic Developmental Languages without Interactions. Theor. Comput. Sci.\u00a01(1), 59\u201375 (1975)","journal-title":"Theor. Comput. Sci."},{"key":"16_CR10","volume-title":"An Introduction to Probability Theory and Its Applications","author":"W. Feller","year":"1971","unstructured":"Feller, W.: 12. In: An Introduction to Probability Theory and Its Applications, vol.\u00a01, John Wiley & sons, Chichester (1971)"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Hellman, M.E.: A cryptanalytic time-memory trade off. In: IEEE Transactions on Information Theory, vol.\u00a0IT-26, pp. 401\u2013406 (1980)","DOI":"10.1109\/TIT.1980.1056220"},{"issue":"1-3","key":"16_CR12","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.tcs.2004.06.023","volume":"326","author":"S. Janson","year":"2004","unstructured":"Janson, S., Lonardi, S., Szpankowski, W.: On average sequence complexity. Theor. Comput. Sci.\u00a0326(1-3), 213\u2013227 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"16_CR13","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":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-540-74143-5_14","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"A. Joux","year":"2007","unstructured":"Joux, A., Peyrin, T.: Hash Functions and the (Amplified) Boomerang Attack. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622, pp. 244\u2013263. Springer, Heidelberg (2007)"},{"key":"16_CR15","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":"16_CR16","doi-asserted-by":"crossref","unstructured":"Kelsey, J., Schneier, B.: Second Preimages on n-Bit Hash Functions for Much Less than 2n Work. In: [6], pp. 474\u2013490","DOI":"10.1007\/11426639_28"},{"key":"16_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/3-540-55719-9_62","volume-title":"Automata, Languages and Programming","author":"V. Ker\u00e4nen","year":"1992","unstructured":"Ker\u00e4nen, V.: Abelian Squares are Avoidable on 4 Letters. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol.\u00a0623, pp. 41\u201352. Springer, Heidelberg (1992)"},{"key":"16_CR18","unstructured":"Ker\u00e4nen, V.: On abelian square-free DT0L-languages over 4 letters.. In: Harju, T. (ed.) WORDS 2003, vol.\u00a027, pp. 95\u2013109. TUCS General Publication (2003)"},{"key":"16_CR19","unstructured":"Klima, V.: Tunnels in Hash Functions: MD5 Collisions Within a Minute. Cryptology ePrint Archive, Report 2006\/105 (2006) http:\/\/eprint.iacr.org\/"},{"key":"16_CR20","unstructured":"Menezes, A., van Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography"},{"key":"16_CR21","doi-asserted-by":"crossref","unstructured":"Merkle, R.C.: One Way Hash Functions and DES. In: [4], pp. 428\u2013446","DOI":"10.1007\/0-387-34805-0_40"},{"key":"16_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/3-540-44987-6_11","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"I. Mironov","year":"2001","unstructured":"Mironov, I.: Hash Functions: From Merkle-Damg\u00e5rd to Shoup. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 166\u2013181. Springer, Heidelberg (2001)"},{"key":"16_CR23","unstructured":"Orr\u00a0Dunkelman, E.B.: A Framework for Iterative Hash Functions \u2014 HAIFA. Presented at the second NIST hash workshop (August 24\u201325, 2006)"},{"key":"16_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1007\/3-540-13345-3_34","volume-title":"Automata, Languages, and Programming","author":"J.-J. Pansiot","year":"1984","unstructured":"Pansiot, J.-J.: Complexit\u00e9 des facteurs des mots infinis engendr\u00e9s par morphismes it\u00e9r\u00e9s. In: Paredaens, J. (ed.) ICALP 1984. LNCS, vol.\u00a0172, pp. 380\u2013389. Springer, Heidelberg (1984)"},{"key":"16_CR25","unstructured":"Rivest, R.L.: Abelian Square-Free Dithering for Iterated Hash Functions. In: Presented at ECrypt Hash Function Workshop, June 21, 2005, Cracow, and at the Cryptographic Hash workshop, November 1, 2005, Gaithersburg, Maryland (August 2005)"},{"key":"16_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/3-540-45539-6_32","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"V. Shoup","year":"2000","unstructured":"Shoup, V.: A Composition Theorem for Universal One-Way Hash Functions. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 445\u2013452. Springer, Heidelberg (2000)"},{"key":"16_CR27","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","year":"2005","unstructured":"Shoup, V. (ed.): CRYPTO 2005. LNCS, vol.\u00a03621. Springer, Heidelberg (2005)"},{"key":"16_CR28","doi-asserted-by":"crossref","unstructured":"Wang, X., Lai, X., Feng, D., Chen, H., Yu, X.: Cryptanalysis of the Hash Functions MD4 and RIPEMD. In: [6], pp. 1\u201318","DOI":"10.1007\/11426639_1"},{"key":"16_CR29","doi-asserted-by":"crossref","unstructured":"Wang, X., Yin, Y.L., Yu, H.: Finding Collisions in the Full SHA-1. In: [27], pp. 17\u201336","DOI":"10.1007\/11535218_2"},{"key":"16_CR30","doi-asserted-by":"crossref","unstructured":"Wang, X., Yu, H.: How to Break MD5 and Other Hash Functions. In: [6], pp. 19\u201335","DOI":"10.1007\/11426639_2"},{"key":"16_CR31","doi-asserted-by":"crossref","unstructured":"Wang, X., Yu, H., Yin, Y.L.: Efficient Collision Search Attacks on SHA-0. In: [27], pp. 1\u201316","DOI":"10.1007\/11535218_1"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78967-3_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:16:38Z","timestamp":1606184198000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78967-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540789666","9783540789673"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78967-3_16","relation":{},"subject":[]}}