HF-hash : Hash Functions Using Restricted HFE Challenge-1
Cryptography and Security
2010-07-21 v2 Commutative Algebra
Abstract
Vulnerability of dedicated hash functions to various attacks has made the task of designing hash function much more challenging. This provides us a strong motivation to design a new cryptographic hash function viz. HF-hash. This is a hash function, whose compression function is designed by using first 32 polynomials of HFE Challenge-1 with 64 variables by forcing remaining 16 variables as zero. HF-hash gives 256 bits message digest and is as efficient as SHA-256. It is secure against the differential attack proposed by Chabaud and Joux as well as by Wang et. al. applied to SHA-0 and SHA-1.
Cite
@article{arxiv.0909.1392,
title = {HF-hash : Hash Functions Using Restricted HFE Challenge-1},
author = {Dhananjoy Dey and Prasanna Raghaw Mishra and Indranath Sengupta},
journal= {arXiv preprint arXiv:0909.1392},
year = {2010}
}
Comments
44 pages including 32 pages appendix (list of polynomials) 2 figures, corrected Surname