{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:29:53Z","timestamp":1725542993331},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642107801"},{"type":"electronic","value":"9783642107818"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-10781-8_40","type":"book-chapter","created":{"date-parts":[[2010,1,6]],"date-time":"2010-01-06T05:11:44Z","timestamp":1262754704000},"page":"391-400","source":"Crossref","is-referenced-by-count":0,"title":["On the Computational Asymmetry of the S-Boxes Present in Blue Midnight Wish Cryptographic Hash Function"],"prefix":"10.1007","author":[{"given":"Danilo","family":"Gligoroski","sequence":"first","affiliation":[]},{"given":"Vlastimil","family":"Klima","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"40_CR1","doi-asserted-by":"crossref","unstructured":"Rivest, R.: The MD4 message-digest algorithm, Request for Comments (RFC) 1320, Internet Activities Board, Internet Privacy Task Force (April 1992)","DOI":"10.17487\/rfc1320"},{"key":"40_CR2","doi-asserted-by":"crossref","unstructured":"Rivest, R.: The MD5 message-digest algorithm, Request for Comments (RFC) 1321, Internet Activities Board, Internet Privacy Task Force (April 1992)","DOI":"10.17487\/rfc1321"},{"key":"40_CR3","unstructured":"FIPS 180-1, Secure Hash Standard, Federal Information Processing Standards Publication 180-1, U.S. Department of Commerce\/NIST, National Technical Information Service, Springfield, Virginia (April 1995)"},{"key":"40_CR4","unstructured":"FIPS 180-2, Secure Hash Standard, Federal Information Processing Standards Publication 180-2, U.S. Department of Commerce\/NIST, National Technical Information Service, Springfield, Virginia (August 2002)"},{"key":"40_CR5","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)"},{"key":"40_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/3-540-48285-7_26","volume-title":"Advances in Cryptology - EUROCRYPT \u201993","author":"B. Boer den","year":"1994","unstructured":"den Boer, B., Bosselaers, A.: Collisions for the compression function of MD-5. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol.\u00a0765, pp. 293\u2013304. Springer, Heidelberg (1994)"},{"key":"40_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/3-540-60590-8_22","volume-title":"Fast Software Encryption","author":"S. Vaudenay","year":"1995","unstructured":"Vaudenay, S.: On the need for multipermutations: Cryptanalysis of MD4 and SAFER. In: Preneel, B. (ed.) FSE 1994. LNCS, vol.\u00a01008, pp. 286\u2013297. Springer, Heidelberg (1995)"},{"key":"40_CR8","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s001459900047","volume":"11","author":"H. Dobbertin","year":"1998","unstructured":"Dobbertin, H.: Cryptanalysis of MD4. J. Cryptology\u00a011, 253\u2013271 (1998)","journal-title":"J. Cryptology"},{"key":"40_CR9","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":"40_CR10","unstructured":"Biham, E., Chen, R.: Near-collisions of SHA-0. Cryptology ePrint Archive, Report 2004\/146 (2004), http:\/\/eprint.iacr.org\/2004\/146"},{"key":"40_CR11","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":"40_CR12","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":"40_CR13","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":"40_CR14","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":"40_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-540-24654-1_13","volume-title":"Selected Areas in Cryptography","author":"H. Gilbert","year":"2004","unstructured":"Gilbert, H., Handschuh, H.: Security analysis of SHA-256 and sisters. In: Matsui, M., Zuccherato, R.J. (eds.) SAC 2003. LNCS, vol.\u00a03006, pp. 175\u2013193. Springer, Heidelberg (2004)"},{"key":"40_CR16","unstructured":"Hawkes, P., Paddon, M., Rose, G.G.: On corrective patterns for the SHA-2 family, Cryptology ePrint Archive, Report 2004\/207 (2004)"},{"key":"40_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/11693383_17","volume-title":"Selected Areas in Cryptography","author":"H. Yoshida","year":"2006","unstructured":"Yoshida, H., Biryukov, A.: Analysis of a SHA-256 variant. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol.\u00a03897, pp. 245\u2013260. Springer, Heidelberg (2006)"},{"key":"40_CR18","unstructured":"Matusiewicz, K., Pieprzyk, J., Pramstaller, N., Rechberger, C., Rijmen, V.: Analysis of simplified variants of SHA-256. In: Proceedings of WEWoRC 2005, vol.\u00a0LNI P-74, pp. 123\u2013134 (2005)"},{"key":"40_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/11799313_9","volume-title":"Fast Software Encryption","author":"F. Mendel","year":"2006","unstructured":"Mendel, F., Pramstaller, N., Rechberger, C., Rijmen, V.: Analysis of step-reduced SHA-256. In: Robshaw, M.J.B. (ed.) FSE 2006. LNCS, vol.\u00a04047, pp. 126\u2013143. Springer, Heidelberg (2006)"},{"key":"40_CR20","unstructured":"H\u00f6lbl, M., Rechberger, C., Welzer, T.: Finding message pairs conforming to simple SHA-256 characteristics: Work in Progress. In: Western European Workshop on Research in Cryptology - WEWoRC 2007, Bochum, July 4-6, pp. 21\u201325 (2007), http:\/\/www.hgi.rub.de\/weworc07\/PreliminaryConferenceRecord.pdf"},{"key":"40_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-71039-4_1","volume-title":"Fast Software Encryption","author":"I. Nikolic\u0300","year":"2008","unstructured":"Nikolic\u0300, I., Biryukov, A.: Collisions for Step-Reduced SHA-256. In: Nyberg, K. (ed.) FSE 2008. LNCS, vol.\u00a05086, pp. 1\u201315. Springer, Heidelberg (2008)"},{"key":"40_CR22","doi-asserted-by":"crossref","unstructured":"Indesteege, S., Mendel, F., Preneel, B., Rechberger, C.: Collisions and other Non-Random Properties for Step-Reduced SHA-256. Cryptology ePrint Archive, Report 2008\/131 (2008), http:\/\/eprint.iacr.org\/","DOI":"10.1007\/978-3-642-04159-4_18"},{"key":"40_CR23","unstructured":"NIST, First Cryptographic Hash Workshop, October 31 - November 1 (2005), Second Cryptographic Hash Workshop, August 24-25 (2006), http:\/\/csrc.nist.gov\/groups\/ST\/hash\/first_workshop.html , http:\/\/csrc.nist.gov\/groups\/ST\/hash\/second_workshop.html"},{"key":"40_CR24","unstructured":"NIST Tentative Timeline for the Development of New Hash Functions, http:\/\/csrc.nist.gov\/groups\/ST\/hash\/timeline.html"},{"key":"40_CR25","unstructured":"NIST, SHA-3 First Round Candidates, http:\/\/csrc.nist.gov\/groups\/ST\/hash\/sha-3\/Round1\/submissions_rnd1.html"},{"key":"40_CR26","unstructured":"NIST, SHA-3 Second Round Candidates, http:\/\/csrc.nist.gov\/groups\/ST\/hash\/sha-3\/Round2\/submissions_rnd2.html"},{"key":"40_CR27","unstructured":"Gligoroski, D., Klima, V., Knapskog, S.J., El-Hadedy, M., Amundsen, J., Mj\u00f8lsnes, S.F.: Cryptographic Hash Function BLUE MIDNIGHT WISH. Submission to NIST (2008)"},{"key":"40_CR28","unstructured":"Birget, J.-C.: One-way permutations, computational asymmetry and distortion\u201d, arXiv:0704.1569v1 [math.GR] (2007), http:\/\/arxiv.org\/abs\/0704.1569v1"},{"key":"40_CR29","unstructured":"Klima, V.: Tunnels in Hash Functions: MD5 Collisions Within a Minute, Cryptology ePrint Archive, Report 2006\/105 (2006), http:\/\/eprint.iacr.org\/"}],"container-title":["ICT Innovations 2009"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10781-8_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T23:21:49Z","timestamp":1558740109000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10781-8_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642107801","9783642107818"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10781-8_40","relation":{},"subject":[],"published":{"date-parts":[[2010]]}}}