most citedHF-hash : Hash Functions Using Restricted HFE Challenge-1

3 citations · 3 across the 2 of their papers we have counts for

collaborators
Showing cs.CRShow all

2 papers · 1 filter

cs.CR2010

GB-hash : Hash Functions Using Groebner Basis

Dhananjoy Dey, Prasanna Raghaw Mishra1, Indranath Sengupta

In this paper we present an improved version of HF-hash, viz., GB-hash : Hash Functions Using Groebner Basis. In case of HF-hash, the compression function consists of 32 polynomial…

cs.CR2009★ 3 cited

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

Dhananjoy Dey, Prasanna Raghaw Mishra, Indranath Sengupta

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 ne…