{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T13:44:02Z","timestamp":1773150242549,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540354819","type":"print"},{"value":"9783540354826","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11779360_14","type":"book-chapter","created":{"date-parts":[[2006,11,16]],"date-time":"2006-11-16T03:17:10Z","timestamp":1163647030000},"page":"164-177","source":"Crossref","is-referenced-by-count":12,"title":["Finding Good Differential Patterns for Attacks on SHA-1"],"prefix":"10.1007","author":[{"given":"Krystian","family":"Matusiewicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Josef","family":"Pieprzyk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/978-3-540-28628-8_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"E. Biham","year":"2004","unstructured":"Biham, E., Chen, R.: Near-collisions of SHA-0. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 290\u2013305. Springer, Heidelberg (2004)"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/978-3-540-28628-8_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"E. Biham","year":"2004","unstructured":"Biham, E., Chen, R.: Near-collisions of SHA-0. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 290\u2013305. Springer, Heidelberg (2004)"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","volume-title":"Integrity Primitives for Secure Information Systems","year":"1995","unstructured":"Bosselaers, A., Preneel, B. (eds.): RIPE 1992. LNCS, vol.\u00a01007. Springer, Heidelberg (1995)"},{"issue":"1","key":"14_CR4","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1109\/18.651067","volume":"44","author":"A. Canteaut","year":"1998","unstructured":"Canteaut, A., Chabaud, F.: A new algorithm for finding minimum-weight words in a linear code: application to McEliece\u2019s cryptosystem and to narrow-sense BCH codes of length 511. IEEE T. Inform. Theory\u00a044(1), 367\u2013378 (1998)","journal-title":"IEEE T. Inform. Theory"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BFb0053430","volume-title":"Advances in Cryptology - EUROCRYPT 1994","author":"F. Chabaud","year":"1995","unstructured":"Chabaud, F.: On the security of some cryptosystems based on error-correcting codes. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol.\u00a0950, pp. 131\u2013139. Springer, Heidelberg (1995)"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/BFb0055720","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"F. Chabaud","year":"1998","unstructured":"Chabaud, F., Joux, A.: Differential collisions in SHA-0. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 56\u201371. Springer, Heidelberg (1998)"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1007\/3-540-46766-1_14","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"B. Boer den","year":"1992","unstructured":"den Boer, B., Bosselaers, A.: An attack on the last two rounds of MD4. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 194\u2013203. Springer, Heidelberg (1992)"},{"issue":"2","key":"14_CR8","first-page":"3","volume":"2","author":"H. Dobbertin","year":"1996","unstructured":"Dobbertin, H.: The status of MD5 after a recent attack. CryptoBytes\u00a02(2), 1,3\u20136 (1996)","journal-title":"CryptoBytes"},{"issue":"1","key":"14_CR9","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s001459900019","volume":"10","author":"H. Dobbertin","year":"1997","unstructured":"Dobbertin, H.: RIPEMD with two-round compress function is not collison free. Journal of Cryptology\u00a010(1), 51\u201370 (1997)","journal-title":"Journal of Cryptology"},{"issue":"4","key":"14_CR10","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s001459900047","volume":"11","author":"H. Dobbertin","year":"1998","unstructured":"Dobbertin, H.: Cryptanalysis of MD4. Journal of Cryptology\u00a011(4), 253\u2013271 (1998)","journal-title":"Journal of Cryptology"},{"key":"14_CR11","unstructured":"FIPS\u00a0180. Secure hash standard (SHS). National Institute of Standards and Technology (May 1993) Replaced by [15]"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"A. Joux","year":"2004","unstructured":"Joux, A.: Collisions in SHA-0. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152. Springer, Heidelberg (2004)"},{"key":"14_CR13","unstructured":"Lemuet, C.: Collision in SHA-0. sci.crypt newsgroup message, Message-ID: cfg0071h1b1@io.uvsq.fr, August 12 (2004)"},{"issue":"5","key":"14_CR14","doi-asserted-by":"publisher","first-page":"1354","DOI":"10.1109\/18.21270","volume":"34","author":"J.S. Leon","year":"1988","unstructured":"Leon, J.S.: A probabilistic algorithm for computing minimum weights of large error-correcting codes. IEEET. Inform. Theory\u00a034(5), 1354\u20131359 (1988)","journal-title":"IEEET. Inform. Theory"},{"key":"14_CR15","unstructured":"National Institute of Standards and Technology. Secure hash standard (SHS). FIPS\u00a0180-2 (August 2002)"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/11586821_7","volume-title":"Cryptography and Coding","author":"N. Pramstaller","year":"2005","unstructured":"Pramstaller, N., Rechberger, C., Rijmen, V.: Exploiting coding theory for collision attacks on SHA-1. In: Smart, N.P. (ed.) Cryptography and Coding 2005. LNCS, vol.\u00a03796, pp. 78\u201395. Springer, Heidelberg (2005)"},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/978-3-540-30574-3_6","volume-title":"Topics in Cryptology \u2013 CT-RSA 2005","author":"V. Rijmen","year":"2005","unstructured":"Rijmen, V., Oswald, E.: Update on SHA-1. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol.\u00a03376, pp. 58\u201371. Springer, Heidelberg (2005)"},{"key":"14_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/3-540-38424-3_22","volume-title":"Advances in Cryptology - CRYPTO \u201990","author":"R.L. Rivest","year":"1991","unstructured":"Rivest, R.L.: The MD4 message digest algorithm. In: Menezes, A., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol.\u00a0537, pp. 303\u2013311. Springer, Heidelberg (1991)"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Rivest, R.L.: The MD4 message digest algorithm. Request for Comments (RFC) 1320, Internet Engineering Task Force (April 1992)","DOI":"10.17487\/rfc1320"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Rivest, R.L.: The MD5 message digest algorithm. Request for Comments (RFC) 1321, Internet Engineering Task Force (April 1992)","DOI":"10.17487\/rfc1321"},{"key":"14_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-540-40061-5_14","volume-title":"Advances in Cryptology - ASIACRYPT 2003","author":"B. Rompay Van","year":"2003","unstructured":"Van Rompay, B., Biryukov, A., Preneel, B., Vandewalle, J.: Cryptanalysis of 3-pass HAVAL. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol.\u00a02894, pp. 228\u2013245. Springer, Heidelberg (2003)"},{"issue":"6","key":"14_CR22","doi-asserted-by":"publisher","first-page":"1757","DOI":"10.1109\/18.641542","volume":"43","author":"A. Vardy","year":"1997","unstructured":"Vardy, A.: The intractability of computing the minimum distance of a code. IEEET. Inform. Theory\u00a043(6), 1757\u20131766 (1997)","journal-title":"IEEET. Inform. Theory"},{"key":"14_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11426639_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"X. Wang","year":"2005","unstructured":"Wang, X., Lai, X., Feng, D., Chen, H., Yu, X.: Cryptanalysis of the hash functions MD4 and RIPEMD. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 1\u201318. Springer, Heidelberg (2005)"},{"key":"14_CR24","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"X. Wang","year":"2004","unstructured":"Wang, X., Lai, X., Feng, D., Yu, H.: Collisions for hash functions MD4, MD5, HAVAL-128 and RIPEMD. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, Springer, Heidelberg (2004)"},{"key":"14_CR25","unstructured":"Wang, X., Lai, X., Feng, D., Yu, H.: Collisions for hash functions MD4, MD5, HAVAL-128 and RIPEMD. Cryptology ePrint Archive, Report, 2004\/199 (August 2004), http:\/\/eprint.iacr.org\/"},{"key":"14_CR26","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":"14_CR27","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":"14_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11535218_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"X. Wang","year":"2005","unstructured":"Wang, X., Yu, H., Yin, Y.L.: Efficient collision search attacks on SHA-0. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 1\u201316. Springer, Heidelberg (2005)"},{"key":"14_CR29","series-title":"Lecture Notes in Computer Science","first-page":"83","volume-title":"Advances in Cryptology - AUSCRYPT \u201992","author":"Y. Zheng","year":"1993","unstructured":"Zheng, Y., Pieprzyk, J.: HAVAL \u2013 a one-way hashing algorithm with variable length of output. In: Zheng, Y., Seberry, J. (eds.) AUSCRYPT 1992. LNCS, vol.\u00a0718, pp. 83\u2013104. Springer, Heidelberg (1993)"}],"container-title":["Lecture Notes in Computer Science","Coding and Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11779360_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T06:37:41Z","timestamp":1555915061000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11779360_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354819","9783540354826"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/11779360_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}