Cryptanalysis of FORK-256

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4593 LNCS, Issue , 2007, Pages 19-38

  Matusiewicz, Krystian ^a   Peyrin, Thomas ^b   Billet, Olivier ^b   Contini, Scott ^a   Pieprzyk, Josef ^a  

^a MACQUARIE UNIVERSITY   (Australia)

^b ORANGE LABS   (France)

Author keywords

Cryptanalysis; FORK 256; Hash functions; Micro collisions

Indexed keywords

COMPUTATIONAL COMPLEXITY; FUNCTION EVALUATION; MATHEMATICAL TRANSFORMATIONS;

CRYPTANALYSIS; HASH FUNCTION; PSEUDO-COLLISION;

CRYPTOGRAPHY;

EID: 38149037030     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74619-5_2     Document Type: Conference Paper

References (21)

1. Anderson, R., Biham, E.: Tiger: A fast new hash function. In: Gollmann, D. (ed.) FSE'96. LNCS, vol. 1039, pp. 121-144. Springer, Heidelberg (1996)
2. Hong, D., Chang, D., Sung, J., Lee, S., Hong, S., Lee, J., Moon, D., Chee, S.: A New Dedicated 256-bit Hash Function: FORK-256. In: Robshaw, M. (ed.) FSE 2006. LNCS, vol. 4047, pp. 195-209. Springer, Heidelberg (2006)
3. 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)
4. Intel Corporation. Intel 64 and IA-32 architectures optimization reference manual (2006) Appendix C, Instruction latency and throughput. Available from http://developer.Intel.com/design/processor/manuals/248966.pdf
5. Lipmaa, H., Walln, J., Dumas, P.: On the additive differential probability of exclusive-or. In: Fast Software Encryption - FSE '04. LNCS, vol. 3017, pp. 317-331. Springer, Heidelberg (2004)
6. Matusiewicz, K., Contini, S., Pieprzyk, J.: Cryptanalysis of FORK-256. Web page, http://www.ics.mq.edu.au/-kmatus/FORK/
7. Matusiewicz, K., Contini, S., Pieprzyk, J.: Weaknesses of the compression function of FORK-256. IACR e-print Archive, report 2006/317, available from http://eprint.iacr.org/2006/317
8. 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. 4377, pp. 85-100. Springer, Heidelberg (2006)
9. Muller, F.: Personal communication (2006)
10. National Institute of Standards and Technology. Secure hash standard (SHS). FIPS 180-1 (April 1995) Replaced by [11].
11. National Institute of Standards and Technology. Secure hash standard (SHS). FIPS 180-2 (August 2002)
12. Preneel, B., Bosselaers, A., Dobbertin, H.: RIPEMD-160: A strenghtened Version of RIPEMD. In: Gollmann, D. (ed.) FSE'96. LNCS, vol. 1039, pp. 71-82. Springer, Heidelberg (1996)
13. Rivest, R.L.: The MD4 Message Digest Algorithm. In: Menezes, A.J., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol. 537, pp. 303-311. Springer, Heidelberg (1991)
14. Rivest, R.L.: The MD4 Message Digest Algorithm. RFC 1320, IETF (April 1992)
15. Rivest, R.L.: The MD5 Message Digest Algorithm. RFC 1321, IETF (April 1992)
16. Schneier, B., Kesley, J.: Unbalanced Feistel networks and block cipher design. In: Gollmann, D. (ed.) FSE'96. LNCS, vol. 1039, pp. 121-144. Springer, Heidelberg (1996)
17. Wang, X., Lai, X., Feng, D., Chen, H., Yu, X.: Cryptanalysis of the Hash Functions MD4 and RIPEMD. In: Cramer, R.J.F. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 1-18. Springer, Heidelberg (2005)
18. Wang, X., Yin, Y.L., Yu, H.: Finding collisions in the full SHA-I. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 17-36. Springer, Heidelberg (2005)
19. Wang, X., Yu, H.: How to break MD5 and other hash functions. In: Cramer, R.J.F. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 19-35. Springer, Heidelberg (2005)
20. Wang, X., Yu, H., Yin, Y.L.: Efficient collision search attacks on SHA-0. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 1-16. Springer, Heidelberg (2005)
21. Zheng, Y., Pieprzyk, J., Seberry, J.: HAVAL - A One-Way Hashing Algorithm with Variable Length of Output. In: Zheng, Y., Seberry, J. (eds.) AUSCRYPT 1992. LNCS, vol. 718, pp. 83-104. Springer, Heidelberg (1993)