CryptoDB
F-HASH: Securing Hash Functions Using Feistel Chaining
Authors: | |
---|---|
Download: | |
Abstract: | 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. |
BibTeX
@misc{eprint-2005-12763, title={F-HASH: Securing Hash Functions Using Feistel Chaining}, booktitle={IACR Eprint archive}, keywords={Hash, Block cipher, Feistel Structure}, url={http://eprint.iacr.org/2005/430}, note={ duoduolei@gmail.com 13381 received 26 Nov 2005, last revised 20 Aug 2006}, author={Duo Lei}, year=2005 }