HF-hash : Hash Functions Using Restricted HFE Challenge-1

Details HF-hash : Hash Functions Using Restricted HFE Challenge-1 HF-hash : Hash Functions Using Restricted HFE Challenge-1

2009-09-08

arxiv.org/abs/0909.1392v2

Computer Science

Cryptography and Security

44 pages including 32 pages appendix (list of polynomials) 2 figures, corrected Surname

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

HF-hash : Hash Functions Using Restricted HFE Challenge-1 does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with HF-hash : Hash Functions Using Restricted HFE Challenge-1, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and HF-hash : Hash Functions Using Restricted HFE Challenge-1 will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-107726