{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:21:41Z","timestamp":1758266501424},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642033162"},{"type":"electronic","value":"9783642033179"}],"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-03317-9_14","type":"book-chapter","created":{"date-parts":[[2009,7,11]],"date-time":"2009-07-11T09:16:40Z","timestamp":1247303800000},"page":"228-245","source":"Crossref","is-referenced-by-count":9,"title":["Meet-in-the-Middle Attacks on SHA-3 Candidates"],"prefix":"10.1007","author":[{"given":"Dmitry","family":"Khovratovich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivica","family":"Nikoli\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ralf-Philipp","family":"Weinmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Van Assche, G.: Sponge functions (2007), \n                    \n                      http:\/\/sponge.noekeon.org\/"},{"key":"14_CR2","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. Canni\u00e8re De","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":"14_CR3","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1109\/C-M.1977.217750","volume":"10","author":"W. Diffie","year":"1977","unstructured":"Diffie, W., Hellman, M.E.: Exhaustive cryptanalysis of the NBS data encryption standard. Computer\u00a010, 74\u201384 (1977)","journal-title":"Computer"},{"key":"14_CR4","unstructured":"Gligoroski, D., \u00d8deg\u00e5rd, R.S., Mihova, M., Knapskog, S.J., Kocarev, L., Dr\u00e1pal, A.: Cryptographic hash function Edon-R. Submission to NIST (2008), \n                    \n                      http:\/\/people.item.ntnu.no\/danilog\/Hash\/Edon-R\/Supporting_Documentation\/EdonRDocumentation.pdf"},{"key":"14_CR5","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":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/3-540-46766-1_13","volume-title":"CRYPTO 1991","author":"H. Morita","year":"1992","unstructured":"Morita, H., Ohta, K., Miyaguchi, S.: A switching closure test to analyze cryptosystems. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 183\u2013193. Springer, Heidelberg (1992)"},{"key":"14_CR7","unstructured":"National\u00a0Institute of\u00a0Standards and Technology. Announcing Request for Candidate Algorithm Nominations for a New Cryptographic Hash Algorithm (SHA\u20133) Family\u00a072(212) of Federal Register (November 2007)"},{"key":"14_CR8","unstructured":"O\u2019Neil, S.: EnRUPT: First all-in-one symmetric cryptographic primitive. In: SASC 2008 (2008), \n                    \n                      http:\/\/www.ecrypt.eu.org\/stvl\/sasc2008\/"},{"key":"14_CR9","unstructured":"O\u2019Neil, S., Nohl, K., Henzen, L.: EnRUPT hash function specification (2008), \n                    \n                      http:\/\/enrupt.com\/SHA3\/"},{"key":"14_CR10","unstructured":"Preneel, B.: Analysis and Design of Cryptographic Hash Functions. PhD thesis, Katholieke Universiteit Leuven, Leuven, Belgium (January 1993)"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/3-540-46885-4_43","volume-title":"Advances in Cryptology - EUROCRYPT \u201989","author":"J.-J. Quisquater","year":"1989","unstructured":"Quisquater, J.-J., Delescaille, J.-P.: How easy is collision search? Application to DES (extended summary). In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol.\u00a0434, pp. 429\u2013434. Springer, Heidelberg (1989)"},{"key":"14_CR12","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":"14_CR13","unstructured":"Rose, G.G.: Design and primitive specification for Boole, \n                    \n                      http:\/\/seer-grog.net\/BoolePaper.pdf"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"van Oorschot, P.C., Wiener, M.J.: Parallel collision search with application to hash functions and discrete logarithms. In: ACM Conference on Computer and Communications Security, pp. 210\u2013218 (1994)","DOI":"10.1145\/191177.191231"},{"key":"14_CR15","unstructured":"Var\u0131c\u0131, K., \u00d6zen, O., Kocair, \u00c7.: Sarmal: SHA-3 proposal. Submission to NIST (2008)"},{"key":"14_CR16","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)"}],"container-title":["Lecture Notes in Computer Science","Fast Software Encryption"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03317-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T04:14:49Z","timestamp":1552104889000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03317-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642033162","9783642033179"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03317-9_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}