{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:28:34Z","timestamp":1743146914579,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540770473"},{"type":"electronic","value":"9783540770480"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"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":[[2007]]},"DOI":"10.1007\/978-3-540-77048-0_23","type":"book-chapter","created":{"date-parts":[[2007,11,16]],"date-time":"2007-11-16T10:10:22Z","timestamp":1195207822000},"page":"296-305","source":"Crossref","is-referenced-by-count":1,"title":["Extending FORK-256 Attack to the Full Hash Function"],"prefix":"10.1007","author":[{"given":"Scott","family":"Contini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krystian","family":"Matusiewicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Josef","family":"Pieprzyk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/3-540-60865-6_49","volume-title":"Fast Software Encryption","author":"R. Anderson","year":"1996","unstructured":"Anderson, R., Biham, E.: Tiger: A fast new hash function. In: Gollmann, D. (ed.) Fast Software Encryption. LNCS, vol.\u00a01039, pp. 121\u2013144. Springer, Heidelberg (1996)"},{"key":"23_CR2","unstructured":"Bernstein, D.J.: What output size resists collisions in a xor of independent expansions? In: ECRYPT Hash Workshop (May 2007)"},{"key":"23_CR3","unstructured":"Contini, S., Matusiewicz, K., Pieprzyk, J.: Cryptanalysis of FORK-256. web page (2007), \n                    \n                      http:\/\/www.ics.mq.edu.au\/~kmatus\/FORK\/"},{"key":"23_CR4","unstructured":"Hong, D., Chang, D., Sung, J., Lee, S., Hong, S., Lee, J., Moon, D., Chee, S.: New FORK-256. Cryptology ePrint Archive, Report, 2007\/185 (2007), \n                    \n                      http:\/\/eprint.iacr.org\/2007\/185"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Hong, D., Sung, J., Hong, S., Lee, S., Moon, D.: A new dedicated 256-bit hash function: FORK-256. In: First NIST Workshop on Hash Functions (2005)","DOI":"10.1007\/11799313_13"},{"key":"23_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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. (ed.) FSE 2006. LNCS, vol.\u00a04047, Springer, Heidelberg (2006)"},{"key":"23_CR7","unstructured":"Matusiewicz, K., Contini, S., Pieprzyk, J.: Weaknesses of the FORK-256 compression function. IACR Cryptology e-print Archive, Report 2006\/317 (2006), \n                    \n                      http:\/\/eprint.iacr.org\/2006\/317"},{"key":"23_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/978-3-540-74619-5_2","volume-title":"Fast Software Encryption \u2013 FSE 2007","author":"K. Matusiewicz","year":"2007","unstructured":"Matusiewicz, K., Peyrin, T., Billet, O., Contini, S., Pieprzyk, J.: Cryptanalysis of FORK-256. In: FSE 2007. LNCS, vol.\u00a04593, pp. 19\u201338. Springer, Heidelberg (2007)"},{"key":"23_CR9","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":"2006","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 (2006)"},{"key":"23_CR10","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of Indocrypt 2007","author":"M.-J.O. Saarinen","year":"2007","unstructured":"Saarinen, M.-J.O.: A meet-in-the-middle collision attack against the new FORK-256. In: Proceedings of Indocrypt 2007. LNCS, Springer, Heidelberg (2007)"},{"key":"23_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/3-540-60865-6_49","volume-title":"FSE 1996","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","Information and Communications Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77048-0_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,25]],"date-time":"2019-08-25T20:04:36Z","timestamp":1566763476000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77048-0_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540770473","9783540770480"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77048-0_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}