Article

A new dedicated 256-bit hash function: FORK-256

Authors:

Donghoon Chang,

Sungtaek CheeAuthors Info & Claims

FSE'06: Proceedings of the 13th international conference on Fast Software Encryption

Pages 195 - 209

https://doi.org/10.1007/11799313_13

Published: 15 March 2006 Publication History

Abstract

This paper describes a new software-efficient 256-bit hash function, FORK-256. Recently proposed attacks on MD5 and SHA-1 motivate a new hash function design. It is designed not only to have higher security but also to be faster than SHA-256. The performance of the new hash function is at least 30% better than that of SHA-256 in software. And it is secure against any known cryptographic attacks on hash functions.

References

[1]

E. Biham and R. Chen, "Near-Collisions of SHA-0," Advances in Cryptology - CRYPTO 2004, LNCS 3152, Springer-Verlag, pp. 290-305, 2004.

[2]

E. Biham, R. Chen, A. Joux, P. Carribault, C. Lemuet and W. Jalby, "Collisions of SHA-0 and Reduced SHA-1," Advances in Cryptology - EUROCRYPT 2005, LNCS 3494, Springer-Verlag, pp. 36-57, 2005.

Digital Library

[3]

B. den Boer and A. Bosselaers, "An Attack on the Last Two Rounds of MD4," Advances in Cryptology - CRYPTO'91, LNCS 576, Springer-Verlag, pp. 194-203, 1992.

Digital Library

[4]

B. den Boer and A. Bosselaers, "Collisions for the Compression Function of MD5," Advances in Cryptology - CRYPTO'93, LNCS 765, Springer-Verlag, pp. 293-304, 1994.

Digital Library

[5]

F. Chabaud and A. Joux, "Differential Collisions in SHA-0," Advances in Cryptology - CRYPTO'98, LNCS 1462, Springer-Verlag, pp. 56-71, 1998.

Digital Library

[6]

I. Damgård, "A Design Priciple for Hash Functions," Advances in Cryptology - CRYPTO'89, LNCS 435, Springer-Verlag, pp. 416-427, 1989.

Digital Library

[7]

H. Dobbertin, "RIPEMD with Two-Round Compress Function is Not Collision-Free," Journal of Cryptology 10:1, pp. 51-70, 1997.

Digital Library

[8]

H. Dobbertin, "Cryptanalysis of MD4," Journal of Cryptology 11:4, pp. 253-271, 1998.

Digital Library

[9]

H. Dobbertin, A. Bosselaers and B. Preneel, "RIPEMD-160, a strengthened version of RIPEMD," FSE'96, LNCS 1039, Springer-Verlag, pp. 71-82, 1996.

Digital Library

[10]

R. C. Merkle, "One way hash functions and DES," Advances in Cryptology - CRYPTO'89, LNCS 435, Springer-Verlag, pages 428-446, 1989.

Digital Library

[11]

NIST/NSA, "FIPS 180-2: Secure Hash Standard (SHS)", August 2002 (change notice: February 2004).

[12]

R. L. Rivest, "The MD4 Message Digest Algorithm," Advances in Cryptology - CRYPTO'90, LNCS 537, Springer-Verlag, pp. 303-311, 1991.

Digital Library

[13]

R. L. Rivest, "The MD5 Message-Digest Algorithm," IETF Request for Comments, RFC 1321, April 1992.

[14]

B. Van Rompay, A. Biryukov, B. Preneel and J. Vandewalle, "Cryptanalysis of 3- pass HAVAL," Advances in Cryptology - ASIACRYPT 2003, LNCS 2894, Springer-Verlag, pp. 228-245, 2003.

[15]

X. Wang, X. Lai, D. Feng, H. Chen and X. Yu, "Cryptanalysis of the Hash Functions MD4 and RIPEMD," Advances in Cryptology - EUROCRYPT 2005, LNCS 3494, Springer-Verlag, pp. 1-18, 2005.

Digital Library

[16]

X. Wang and H. Yu, "How to Break MD5 and Other Hash Functions," Advances in Cryptology - EUROCRYPT 2005, LNCS 3494, Springer-Verlag, pp. 19-35, 2005.

Digital Library

[17]

X. Wang, H. Yu and Y. L. Yin, "Efficient Collision Search Attacks on SHA-0," Advances in Cryptology - CRYPTO 2005, LNCS 3621, Springer-Verlag, pp. 1-16, 2005.

Digital Library

[18]

X. Wang, Y. L. Yin and H. Yu, "Finding Collisions in the Full SHA-1," Advances in Cryptology - CRYPTO 2005, LNCS 3621, Springer-Verlag, pp. 17-36, 2005.

Digital Library

[19]

Y. Zheng, J. Pieprzyk and J. Seberry, "HAVAL - A One-Way Hashing Algorithm with Variable Length of Output," Advances in Cryptology - AUSCRYPT'92, LNCS 718, Springer-Verlag, pp. 83-104, 1993.

Digital Library

Cited By

Bogdanov AShibutani K(2013)Generalized Feistel networks revisitedDesigns, Codes and Cryptography10.1007/s10623-012-9660-z66:1-3(75-97)Online publication date: 1-Jan-2013
https://dl.acm.org/doi/10.1007/s10623-012-9660-z
Ohtahara CSasaki YShimoyama T(2010)Preimage attacks on step-reduced RIPEMD-128 and RIPEMD-160Proceedings of the 6th international conference on Information security and cryptology10.5555/2031933.2031950(169-186)Online publication date: 20-Oct-2010
https://dl.acm.org/doi/10.5555/2031933.2031950
Fleischmann EForler CGorski MLucks S(2010)TWISTER π – a framework for secure and fast hash functionsInternational Journal of Applied Cryptography10.1504/IJACT.2010.0338002:1(68-81)Online publication date: 1-Jul-2010
https://dl.acm.org/doi/10.1504/IJACT.2010.033800
Show More Cited By

Recommendations

Cryptanalysis of FORK-256
FSE'07: Proceedings of the 14th international conference on Fast Software Encryption

In this paper we present a cryptanalysis of a new 256-bit hash function, FORK-256, proposed by Hong et al. at FSE 2006. This cryptanalysis is based on some unexpected differentials existing for the step transformation. We show their possible uses in ...
A meet-in-the-middle collision attack against the new FORK-256
INDOCRYPT'07: Proceedings of the cryptology 8th international conference on Progress in cryptology

We show that a 2^112.9 collision attack exists against the FORK-256 Hash Function. The attack is surprisingly simple compared to existing published FORK-256 cryptanalysis work, yet is the best known result against the new, tweaked version of the hash. ...
Analysis of the Kupyna-256 Hash Function
FSE 2016: Revised Selected Papers of the 23rd International Conference on Fast Software Encryption - Volume 9783

The hash function Kupyna was recently published as the Ukrainian standard DSTU 7564:2014. It is structurally very similar to the SHA-3 finalist GrØstl, but differs in details of the round transformations. Most notably, some of the round constants are ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

FSE'06: Proceedings of the 13th international conference on Fast Software Encryption

March 2006

432 pages

ISBN:3540365974

Editor:
Matthew Robshaw
Orange Labs, 38-40 rue du General Leclerc, Issy les Moulineaux, France

Sponsors

Siemens
France Telecom

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 15 March 2006

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

11
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 27 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Bogdanov AShibutani K(2013)Generalized Feistel networks revisitedDesigns, Codes and Cryptography10.1007/s10623-012-9660-z66:1-3(75-97)Online publication date: 1-Jan-2013
https://dl.acm.org/doi/10.1007/s10623-012-9660-z
Ohtahara CSasaki YShimoyama T(2010)Preimage attacks on step-reduced RIPEMD-128 and RIPEMD-160Proceedings of the 6th international conference on Information security and cryptology10.5555/2031933.2031950(169-186)Online publication date: 20-Oct-2010
https://dl.acm.org/doi/10.5555/2031933.2031950
Fleischmann EForler CGorski MLucks S(2010)TWISTER π – a framework for secure and fast hash functionsInternational Journal of Applied Cryptography10.1504/IJACT.2010.0338002:1(68-81)Online publication date: 1-Jul-2010
https://dl.acm.org/doi/10.1504/IJACT.2010.033800
Sasaki YAoki K(2009)Meet-in-the-Middle Preimage Attacks on Double-Branch Hash FunctionsProceedings of the 14th Australasian Conference on Information Security and Privacy10.1007/978-3-642-02620-1_15(214-231)Online publication date: 22-Jun-2009
https://dl.acm.org/doi/10.1007/978-3-642-02620-1_15
Fleischmann EForler CGorski MLucks S(2009)Twister --- A Framework for Secure and Fast Hash FunctionsProceedings of the 5th International Conference on Information Security Practice and Experience10.1007/978-3-642-00843-6_23(257-273)Online publication date: 2-Apr-2009
https://dl.acm.org/doi/10.1007/978-3-642-00843-6_23
Knudsen LRechberger CThomsen S(2007)The Grindahl hash functionsProceedings of the 14th international conference on Fast Software Encryption10.5555/2394499.2394503(39-57)Online publication date: 26-Mar-2007
https://dl.acm.org/doi/10.5555/2394499.2394503
Matusiewicz KPeyrin TBillet OContini SPieprzyk J(2007)Cryptanalysis of FORK-256Proceedings of the 14th international conference on Fast Software Encryption10.5555/2394499.2394502(19-38)Online publication date: 26-Mar-2007
https://dl.acm.org/doi/10.5555/2394499.2394502
Contini SMatusiewicz KPieprzyk J(2007)Extending FORK-256 attack to the full hash functionProceedings of the 9th international conference on Information and communications security10.5555/1785001.1785031(296-305)Online publication date: 12-Dec-2007
https://dl.acm.org/doi/10.5555/1785001.1785031
Peyrin T(2007)Cryptanalysis of GRINDAHLProceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security10.5555/1781454.1781501(551-567)Online publication date: 2-Dec-2007
https://dl.acm.org/doi/10.5555/1781454.1781501
Saarinen M(2007)A meet-in-the-middle collision attack against the new FORK-256Proceedings of the cryptology 8th international conference on Progress in cryptology10.5555/1777898.1777901(10-17)Online publication date: 9-Dec-2007
https://dl.acm.org/doi/10.5555/1777898.1777901
Show More Cited By

View Options

View options

Figures

Tables

Media

View Table of Conten