{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:01:24Z","timestamp":1725566484160},"publisher-location":"Berlin, Heidelberg","reference-count":44,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642140808"},{"type":"electronic","value":"9783642140815"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14081-5_7","type":"book-chapter","created":{"date-parts":[[2010,9,24]],"date-time":"2010-09-24T12:22:49Z","timestamp":1285330969000},"page":"104-116","source":"Crossref","is-referenced-by-count":2,"title":["Second-Preimage Analysis of Reduced SHA-1"],"prefix":"10.1007","author":[{"given":"Christian","family":"Rechberger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/978-3-540-78967-3_16","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"E. Andreeva","year":"2008","unstructured":"Andreeva, E., Bouillaguet, C., Fouque, P.A., Hoch, J.J., Kelsey, J., Shamir, A., Zimmer, S.: Second Preimage Attacks on Dithered Hash Functions. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 270\u2013288. Springer, Heidelberg (2008)"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-642-04159-4_15","volume-title":"Selected Areas in Cryptography","author":"E. Andreeva","year":"2009","unstructured":"Andreeva, E., Preneel, B.: A New Three-Property-Secure Hash Function. In: Avanzi, R.M., Keliher, L., Sica, F. (eds.) SAC 2008. LNCS, vol.\u00a05381, pp. 228\u2013244. Springer, Heidelberg (2009)"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Aoki, K., Sasaki, Y.: Meet-in-the-Middle Preimage Attacks Against Reduced SHA-0 and SHA-1. In: Halevi [11], pp. 70\u201389","DOI":"10.1007\/978-3-642-03356-8_5"},{"key":"7_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: Cramer [5], pp. 36\u201357","DOI":"10.1007\/11426639_3"},{"key":"7_CR5","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":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-540-77360-3_4","volume-title":"Selected Areas in Cryptography","author":"C. De Canni\u00e8re","year":"2007","unstructured":"De Canni\u00e8re, C., Mendel, F., Rechberger, C.: Collisions for 70-Step SHA-1: On the Full Cost of Collision Search. In: Adams, C.M., Miri, A., Wiener, M.J. (eds.) SAC 2007. LNCS, vol.\u00a04876, pp. 56\u201373. Springer, Heidelberg (2007)"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11935230_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2006","author":"C. De Canni\u00e8re","year":"2006","unstructured":"De Canni\u00e8re, C., Rechberger, C.: Finding SHA-1 Characteristics: General Results and Applications. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol.\u00a04284, pp. 1\u201320. Springer, Heidelberg (2006)"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/978-3-540-85174-5_11","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"C. De Canni\u00e8re","year":"2008","unstructured":"De Canni\u00e8re, C., Rechberger, C.: Preimages for Reduced SHA-0 and SHA-1. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 179\u2013202. Springer, Heidelberg (2008)"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","volume-title":"FSE 2009","year":"2009","unstructured":"Dunkelman, O. (ed.): FSE 2009. LNCS, vol.\u00a05665. Springer, Heidelberg (2009)"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Guo, J., Ling, S., Rechberger, C., Wang, H.: Advanced Meet-in-the-Middle Preimage Attacks: First Results on Full Tiger, and Improved Results on MD4 and SHA-2. Cryptology ePrint Archive, Report 2010\/016 (2010), http:\/\/eprint.iacr.org\/","DOI":"10.1007\/978-3-642-17373-8_4"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","volume-title":"CRYPTO 2009","year":"2009","unstructured":"Halevi, S. (ed.): CRYPTO 2009. LNCS, vol.\u00a05677. Springer, Heidelberg (2009)"},{"key":"7_CR12","unstructured":"Hawkes, P., Paddon, M., Rose, G.: Automated Search for Round 1 Differentials for SHA-1: Work in Progress. In: NIST - Second Cryptographic Hash Workshop, August 24-25 (2006)"},{"key":"7_CR13","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":"7_CR14","doi-asserted-by":"crossref","unstructured":"Kelsey, J., Schneier, B.: Second Preimages on n-Bit Hash Functions for Much Less than 2 $^{\\mbox{n}}$ Work. In: Cramer [5], pp. 474\u2013490","DOI":"10.1007\/11426639_28"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Khovratovich, D., Nikolic, I., Weinmann, R.P.: Meet-in-the-Middle Attacks on SHA-3 Candidates. In: Dunkelman [9], pp. 228\u2013245","DOI":"10.1007\/978-3-642-03317-9_14"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/11832072_17","volume-title":"Security and Cryptography for Networks","author":"J. Kim","year":"2006","unstructured":"Kim, J., Biryukov, A., Preneel, B., Hong, S.: On the Security of HMAC and NMAC Based on HAVAL, MD4, MD5, SHA-0 and SHA-1 (Extended Abstract). In: De Prisco, R., Yung, M. (eds.) SCN 2006. LNCS, vol.\u00a04116, pp. 242\u2013256. Springer, Heidelberg (2006)"},{"issue":"1","key":"7_CR17","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/s00145-009-9054-1","volume":"23","author":"L.R. Knudsen","year":"2010","unstructured":"Knudsen, L.R., Mathiassen, J.E., Muller, F., Thomsen, S.S.: Cryptanalysis of MD2. J. Cryptology\u00a023(1), 72\u201390 (2010)","journal-title":"J. Cryptology"},{"key":"7_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-540-74619-5_20","volume-title":"Fast Software Encryption","author":"G. Leurent","year":"2007","unstructured":"Leurent, G.: Message Freedom in MD4 and MD5 Collisions: Application to APOP. In: Biryukov, A. (ed.) FSE 2007. LNCS, vol.\u00a04593, pp. 309\u2013328. Springer, Heidelberg (2007)"},{"key":"7_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/978-3-540-71039-4_26","volume-title":"Fast Software Encryption","author":"G. Leurent","year":"2008","unstructured":"Leurent, G.: MD4 is Not One-Way. In: Nyberg, K. (ed.) FSE 2008. LNCS, vol.\u00a05086, pp. 412\u2013428. Springer, Heidelberg (2008)"},{"key":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/11779360_14","volume-title":"Coding and Cryptography","author":"K. Matusiewicz","year":"2006","unstructured":"Matusiewicz, K., Pieprzyk, J.: Finding Good Differential Patterns for Attacks on SHA-1. In: Ytrehus, \u00d8. (ed.) WCC 2005. LNCS, vol.\u00a03969, pp. 164\u2013177. Springer, Heidelberg (2006)"},{"key":"7_CR21","unstructured":"McDonald, C., Pieprzyk, J., Hawkes, P.: SHA-1 collisions now 252. In: Eurocrypt 2009 Rump Session (2009)"},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/11799313_18","volume-title":"Fast Software Encryption","author":"F. Mendel","year":"2006","unstructured":"Mendel, F., Pramstaller, N., Rechberger, C., Rijmen, V.: The Impact of Carries on the Complexity of Collision Attacks on SHA-1. In: Robshaw, M.J.B. (ed.) FSE 2006. LNCS, vol.\u00a04047, pp. 278\u2013292. Springer, Heidelberg (2006)"},{"key":"7_CR23","unstructured":"National Institute of Standards and Technology: NIST\u2019s Policy on Hash Functions (2008), http:\/\/csrc.nist.gov\/groups\/ST\/hash\/policy.html"},{"key":"7_CR24","unstructured":"National Institute of Standards and Technology (NIST): FIPS-180-2: Secure Hash Standard (August 2002), http:\/\/www.itl.nist.gov\/fipspubs\/"},{"key":"7_CR25","unstructured":"Peyrin, T.: Analyse de fonctions de hachage cryptographiques. Ph.D. thesis (2008)"},{"key":"7_CR26","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":"7_CR27","unstructured":"Rechberger, C.: Preimage Search for a Class of Block Cipher based Hash Functions with Less Computation (2008) (unpublished manuscript)"},{"key":"7_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-540-77366-5_13","volume-title":"Financial Cryptography and Data Security","author":"C. Rechberger","year":"2007","unstructured":"Rechberger, C., Rijmen, V.: On Authentication with HMAC and Non-random Properties. In: Dietrich, S., Dhamija, R. (eds.) FC 2007 and USEC 2007. LNCS, vol.\u00a04886, pp. 119\u2013133. Springer, Heidelberg (2007)"},{"issue":"3","key":"7_CR29","first-page":"347","volume":"14","author":"C. Rechberger","year":"2008","unstructured":"Rechberger, C., Rijmen, V.: New Results on NMAC\/HMAC when Instantiated with Popular Hash Functions. Journal = J. UCS\u00a014(3), 347\u2013376 (2008)","journal-title":"Journal = J. UCS"},{"key":"7_CR30","doi-asserted-by":"crossref","unstructured":"Reyhanitabar, M.R., Susilo, W., Mu, Y.: Enhanced Target Collision Resistant Hash Functions Revisited. In: Dunkelman [9], pp. 327\u2013344","DOI":"10.1007\/978-3-642-03317-9_20"},{"key":"7_CR31","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":"7_CR32","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":"7_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/978-3-540-25937-4_24","volume-title":"Fast Software Encryption","author":"P. Rogaway","year":"2004","unstructured":"Rogaway, P., Shrimpton, T.: Cryptographic Hash-Function Basics: Definitions, Implications, and Separations for Preimage Resistance, Second-Preimage Resistance, and Collision Resistance. In: Roy, B.K., Meier, W. (eds.) FSE 2004. LNCS, vol.\u00a03017, pp. 371\u2013388. Springer, Heidelberg (2004)"},{"key":"7_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-540-89255-7_16","volume-title":"Advances in Cryptology - ASIACRYPT 2008","author":"Y. Sasaki","year":"2008","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)"},{"key":"7_CR35","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 (2010)","DOI":"10.1007\/978-3-642-01001-9_8"},{"key":"7_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-79263-5_1","volume-title":"Topics in Cryptology \u2013 CT-RSA 2008","author":"Y. Sasaki","year":"2008","unstructured":"Sasaki, Y., Wang, L., Ohta, K., Kunihiro, N.: Security of MD5 Challenge and Response: Extension of APOP Password Recovery Attack. In: Malkin, T.G. (ed.) CT-RSA 2008. LNCS, vol.\u00a04964, pp. 1\u201318. Springer, Heidelberg (2008)"},{"key":"7_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-72540-4_1","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"M. Stevens","year":"2007","unstructured":"Stevens, M., Lenstra, A.K., de Weger, B.: Chosen-Prefix Collisions for MD5 and Colliding X.509 Certificates for Different Identities. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 1\u201322. Springer, Heidelberg (2007)"},{"key":"7_CR38","doi-asserted-by":"crossref","unstructured":"Stevens, M., Sotirov, A., Appelbaum, J., Lenstra, A., Molnar, D., Osvik, D.A., de Weger, B.: Short chosen-prefix collisions for MD5 and the creation of a rogue CA certificate. In: Halevi [11], pp. 55\u201369","DOI":"10.1007\/978-3-642-03356-8_4"},{"issue":"2","key":"7_CR39","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s10623-005-6344-y","volume":"38","author":"D.R. Stinson","year":"2006","unstructured":"Stinson, D.R.: Some Observations on the Theory of Cryptographic Hash Functions. Des. Codes Cryptography\u00a038(2), 259\u2013277 (2006)","journal-title":"Des. Codes Cryptography"},{"key":"7_CR40","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":"7_CR41","doi-asserted-by":"crossref","unstructured":"Wang, X., Yu, H.: How to Break MD5 and Other Hash Functions. In: Cramer [5], pp. 19\u201335","DOI":"10.1007\/11426639_2"},{"key":"7_CR42","doi-asserted-by":"crossref","unstructured":"Yajima, J., Iwasaki, T., Naito, Y., Sasaki, Y., Shimoyama, T., Peyrin, T., Kunihiro, N., Ohta, K.: A Strict Evaluation on the Number of Conditions for SHA-1 Collision Search (2009)","DOI":"10.1145\/1368310.1368316"},{"key":"7_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-540-73458-1_4","volume-title":"Information Security and Privacy","author":"J. Yajima","year":"2007","unstructured":"Yajima, J., Sasaki, Y., Naito, Y., Iwasaki, T., Shimoyama, T., Kunihiro, N., Ohta, K.: A New Strategy for Finding a Differential Path of SHA-1. In: Pieprzyk, J., Ghodosi, H., Dawson, E. (eds.) ACISP 2007. LNCS, vol.\u00a04586, pp. 45\u201358. Springer, Heidelberg (2007)"},{"key":"7_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11599371_1","volume-title":"Cryptology and Network Security","author":"H. Yu","year":"2005","unstructured":"Yu, H., Wang, G., Zhang, G., Wang, X.: The Second-Preimage Attack on MD4. In: Desmedt, Y.G., Wang, H., Mu, Y., Li, Y. (eds.) CANS 2005. LNCS, vol.\u00a03810, pp. 1\u201312. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14081-5_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:47:21Z","timestamp":1606168041000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14081-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642140808","9783642140815"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14081-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}