Paper 2005/430 Original: eprint.iacr.org/2005/430 ↗
F-HASH: Securing Hash Functions Using Feistel Chaining
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.
Metadata
- Available format(s)
PDF- Publication info
- Preprint.
- History
- 2006-08-21: last updated
- 2005-11-27: published
- Short URL
- https://ia.cr/2005/430
- License
- https://creativecommons.org/licenses/by/4.0/
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}
}