F-HASH: Securing Hash Functions Using Feistel Chaining

Duo Lei

Paper 2005/430

F-HASH: Securing Hash Functions Using Feistel Chaining

Duo Lei

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.

Note: "Thanks to Dr. Matt Henricksen for editing and structural suggestions".

Metadata

Available format(s): PDF
Publication info: Published elsewhere. Unknown where it was published
Keywords: Hash Block cipher Feistel Structure
Contact author(s): duoduolei @ gmail com
History: 2006-08-21: last of 17 revisions; 2005-11-27: received; See all versions
Short URL: https://ia.cr/2005/430
License: CC BY

BibTeX

@misc{cryptoeprint:2005/430,
      author = {Duo Lei},
      title = {F-{HASH}: Securing Hash Functions Using Feistel Chaining},
      howpublished = {Cryptology {ePrint} Archive, Paper 2005/430},
      year = {2005},
      url = {https://eprint.iacr.org/2005/430}
}