[Resource Topic] 2005/430: F-HASH: Securing Hash Functions Using Feistel Chaining

Welcome to the resource topic for 2005/430

F-HASH: Securing Hash Functions Using Feistel Chaining

Authors: Duo Lei


The Feistel structure is well-known as a good structure for building block ciphers, due to its property of invertibility. It can be made non-invertible by fixing the left half of the input to 0, and by discarding the left half of the output bits. It then becomes suitable as a hash function construction. This paper uses the structure to build a hash function called F-Hash, which is immune to recent attack styles. In this paper, a more precise evaluation method, based upon conditional probability, is given.

ePrint: https://eprint.iacr.org/2005/430

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .