{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:42:14Z","timestamp":1725540134112},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642054433"},{"type":"electronic","value":"9783642054457"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","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-05445-7_9","type":"book-chapter","created":{"date-parts":[[2009,11,3]],"date-time":"2009-11-03T15:03:23Z","timestamp":1257260603000},"page":"141-156","source":"Crossref","is-referenced-by-count":4,"title":["Practical Pseudo-collisions for Hash Functions ARIRANG-224\/384"],"prefix":"10.1007","author":[{"given":"Jian","family":"Guo","sequence":"first","affiliation":[]},{"given":"Krystian","family":"Matusiewicz","sequence":"additional","affiliation":[]},{"given":"Lars R.","family":"Knudsen","sequence":"additional","affiliation":[]},{"given":"San","family":"Ling","sequence":"additional","affiliation":[]},{"given":"Huaxiong","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"Chang, D., Hong, S., Kang, C., Kang, J., Kim, J., Lee, C., Lee, J., Lee, J., Lee, S., Lee, Y., Lim, J., Sung, J.: ARIRANG: SHA-3 Proposal. NIST SHA-3 candidate, \n                    \n                      http:\/\/csrc.nist.gov\/groups\/ST\/hash\/sha-3\/Round1\/documents\/ARIRANG.zip"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-540-77048-0_23","volume-title":"Information and Communications Security","author":"S. Contini","year":"2007","unstructured":"Contini, S., Matusiewicz, K., Pieprzyk, J.: Extending FORK-256 attack to the full hash function. In: Qing, S., Imai, H., Wang, G. (eds.) ICICS 2007. LNCS, vol.\u00a04861, pp. 296\u2013305. Springer, Heidelberg (2007)"},{"key":"9_CR3","unstructured":"Hong, D., Kim, W.-H., Koo, B.: Preimage attack on arirang. Cryptology ePrint Archive, Report 2009\/147 (2009), \n                    \n                      http:\/\/eprint.iacr.org\/2009\/147"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/11799313_13","volume-title":"Fast Software Encryption","author":"D. Hong","year":"2006","unstructured":"Hong, D., Sung, J., Lee, S., Moon, D., Chee, S.: A new dedicated 256-bit hash function. In: Robshaw, M.J.B. (ed.) FSE 2006. LNCS, vol.\u00a04047, pp. 195\u2013209. Springer, Heidelberg (2006)"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"SAC 2009","author":"S. Indesteege","year":"2009","unstructured":"Indesteege, S., Mendel, F., Rechberger, C., Schl\u00e4ffer, M.: Practical Collisions for SHAMATA. In: Jacobson, M.J., Rijmen, V., Safavi-Naini, R. (eds.) SAC 2009. LNCS, vol.\u00a05867, pp. 1\u201315. Springer, Heidelberg (2009)"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-540-74619-5_2","volume-title":"Fast Software Encryption","author":"K. Matusiewicz","year":"2007","unstructured":"Matusiewicz, K., Peyrin, T., Billet, O., Contini, S., Pieprzyk, J.: Cryptanalysis of FORK-256. In: Biryukov, A. (ed.) FSE 2007. LNCS, vol.\u00a04593, pp. 19\u201338. Springer, Heidelberg (2007)"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/11967668_6","volume-title":"Topics in Cryptology \u2013 CT-RSA 2007","author":"F. Mendel","year":"2007","unstructured":"Mendel, F., Lano, J., Preneel, B.: Cryptanalysis of reduced variants of the FORK-256 hash function. In: Abe, M. (ed.) CT-RSA 2007. LNCS, vol.\u00a04377, pp. 85\u2013100. Springer, Heidelberg (2007)"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/978-3-540-77026-8_2","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2007","author":"M.-J. Saarinen","year":"2007","unstructured":"Saarinen, M.-J.: A Meet-in-the-Middle collision attack against the new FORK-256. In: Srinathan, K., Rangan, C.P., Yung, M. (eds.) INDOCRYPT 2007. LNCS, vol.\u00a04859, pp. 10\u201317. Springer, Heidelberg (2007)"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/3-540-60865-6_49","volume-title":"Fast Software Encryption","author":"B. Schneier","year":"1996","unstructured":"Schneier, B., Kesley, J.: Unbalanced Feistel networks and block cipher design. In: Gollmann, D. (ed.) FSE 1996. LNCS, vol.\u00a01039, pp. 121\u2013144. Springer, Heidelberg (1996)"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-05445-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,29]],"date-time":"2020-01-29T16:30:17Z","timestamp":1580315417000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-05445-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642054433","9783642054457"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-05445-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}