{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:37:20Z","timestamp":1742996240308,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642044731"},{"type":"electronic","value":"9783642044748"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04474-8_6","type":"book-chapter","created":{"date-parts":[[2009,9,3]],"date-time":"2009-09-03T07:26:09Z","timestamp":1251962769000},"page":"68-78","source":"Crossref","is-referenced-by-count":2,"title":["Structural Attacks on Two SHA-3 Candidates: Blender-n and DCH-n"],"prefix":"10.1007","author":[{"given":"Mario","family":"Lamberger","sequence":"first","affiliation":[]},{"given":"Florian","family":"Mendel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","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":"6_CR2","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)"},{"unstructured":"National Institute of Standards and Technology: FIPS 180-3, Secure Hash Standard, Federal Information Processing Standard (FIPS), Publication 180-3. Federal Information Processing Standard (October 2008), \n                    \n                      http:\/\/csrc.nist.gov\/publications\/PubsFIPS.html","key":"6_CR3"},{"unstructured":"National Institute of Standards and Technology: Announcing Request for Candidate Algorithm Nominations for a New Cryptographic Hash Algorithm (SHA-3) Family. Federal Register Notice (November 2007), \n                    \n                      http:\/\/csrc.nist.gov","key":"6_CR4"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1007\/0-387-34805-0_39","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"I. Damg\u00e5rd","year":"1990","unstructured":"Damg\u00e5rd, I.: A design principle for hash functions. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 416\u2013427. Springer, Heidelberg (1990)"},{"key":"6_CR6","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)"},{"unstructured":"Bertoni, G., Daemen, J., Assche, G.V., Peeters, M.: Sponge Functions. In: ECRYPT Hash Workshop 2007, Barcelona, May 24-25 (2007)","key":"6_CR7"},{"unstructured":"Biham, E., Dunkelman, O.: A Framework for Iterative Hash Functions - HAIFA. Cryptology ePrint Archive, Report 2007\/278 (2007), \n                    \n                      http:\/\/eprint.iacr.org","key":"6_CR8"},{"key":"6_CR9","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\u00a0Principle for\u00a0Hash\u00a0Functions. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol.\u00a03788, pp. 474\u2013494. Springer, Heidelberg (2005)"},{"unstructured":"Bradbury, C.: BLENDER: A Proposed New Family of Cryptographic Hash Algorithms. Submission to NIST (2008), \n                    \n                      http:\/\/ehash.iaik.tugraz.at\/uploads\/5\/5e\/Blender.pdf","key":"6_CR10"},{"unstructured":"Wilson, D.A.: The DCH Hash Function. Submission to NIST (2008), \n                    \n                      http:\/\/web.mit.edu\/dwilson\/www\/hash\/dch\/Supporting_Documentation\/dch.pdf","key":"6_CR11"},{"unstructured":"Newbold, C.: Observations and Attacks on the SHA-3 Candidate Blender (2008), \n                    \n                      http:\/\/ehash.iaik.tugraz.at\/uploads\/2\/20\/Observations_on_Blender.pdf","key":"6_CR12"},{"unstructured":"Klima, V.: A near-collision attack on Blender-256 (2008), \n                    \n                      http:\/\/cryptography.hyperlink.cz\/BMW\/near_collision_blender.pdf","key":"6_CR13"},{"unstructured":"Klima, V.: Huge Multicollisions and Multipreimages of Hash Functions BLENDER-n. Cryptology ePrint Archive, Report 2009\/006 (2009), \n                    \n                      http:\/\/eprint.iacr.org\/","key":"6_CR14"},{"unstructured":"Liangyu, X., Ji, L.: Semi-free start collision attack on Blender. Cryptology ePrint Archive, Report 2008\/532 (2008), \n                    \n                      http:\/\/eprint.iacr.org\/","key":"6_CR15"},{"unstructured":"Ferguson, N., Lucks, S.: Attacks on AURORA-512 and the Double-Mix Merkle-Damgaard Transform. Cryptology ePrint Archive, Report 2009\/113 (2009), \n                    \n                      http:\/\/eprint.iacr.org\/","key":"6_CR16"},{"unstructured":"Sasaki, Y.: A 2nd-Preimage Attack on AURORA-512. Cryptology ePrint Archive, Report 2009\/112 (2009), \n                    \n                      http:\/\/eprint.iacr.org\/","key":"6_CR17"},{"unstructured":"Sasaki, Y.: A Collision Attack on AURORA-512. Cryptology ePrint Archive, Report 2009\/106 (2009), \n                    \n                      http:\/\/eprint.iacr.org\/","key":"6_CR18"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-540-85174-5_10","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"F. Mendel","year":"2008","unstructured":"Mendel, F., Pramstaller, N., Rechberger, C., Kontak, M., Szmidt, J.: Cryptanalysis of the GOST Hash Function. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 162\u2013178. Springer, Heidelberg (2008)"},{"key":"6_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-540-79263-5_3","volume-title":"Topics in Cryptology \u2013 CT-RSA 2008","author":"P. Gauravaram","year":"2008","unstructured":"Gauravaram, P., Kelsey, J.: Linear-XOR and Additive Checksums Don\u2019t Protect Damg\u00e5rd-Merkle Hashes from Generic Attacks. In: Malkin, T.G. (ed.) CT-RSA 2008. LNCS, vol.\u00a04964, pp. 36\u201351. Springer, Heidelberg (2008)"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"6_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1007\/0-387-34805-0_38","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"J.J. Quisquater","year":"1990","unstructured":"Quisquater, J.J., Delescaille, J.P.: How Easy is Collision Search. New Results and Applications to DES. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 408\u2013413. Springer, Heidelberg (1990)"},{"key":"6_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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)"},{"unstructured":"Khovratovich, D., Nikolic, I.: Cryptanalysis of DCH-n (2008), \n                    \n                      http:\/\/lj.streamclub.ru\/papers\/hash\/dch.pdf","key":"6_CR24"},{"issue":"8","key":"6_CR25","doi-asserted-by":"publisher","first-page":"3647","DOI":"10.1109\/TIT.2008.926420","volume":"54","author":"M. Lamberger","year":"2008","unstructured":"Lamberger, M., Pramstaller, N., Rechberger, C., Rijmen, V.: Analysis of the Hash Function Design Strategy Called SMASH. IEEE Transactions on Information Theory\u00a054(8), 3647\u20133655 (2008)","journal-title":"IEEE Transactions on Information Theory"},{"key":"6_CR26","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":"6_CR27","series-title":"Encyclopedia of Mathematics and its Applications","volume-title":"Finite fields","author":"R. Lidl","year":"1997","unstructured":"Lidl, R., Niederreiter, H.: Finite fields, 2nd edn. Encyclopedia of Mathematics and its Applications, vol.\u00a020. Cambridge University Press, Cambridge (1997); With a foreword by P. M. Cohn","edition":"2"}],"container-title":["Lecture Notes in Computer Science","Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04474-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:29:34Z","timestamp":1558268974000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04474-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642044731","9783642044748"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04474-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}