Dhananjoy Dey
GB-hash : Hash Functions Using Groebner Basis.
Mon, 11/29/2010 - 16:01 — SomNambulAuthors: Dhananjoy Dey, Indranath Sengupta, Prasanna Raghaw Mishra1
Subjects: Cryptography and Security
AbstractIn 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 polynomials with 64 variables which were taken from the first 32
polynomials of hidden field equations challenge-1 by forcing last 16 variables
as 0.HF-hash : Hash Functions Using Restricted HFE Challenge-1.
Wed, 09/09/2009 - 22:08 — SomNambulAuthors: Dhananjoy Dey, Prasanna Raghaw Mishra, Indranath Sen Gupta
Subjects: Cryptography and Security
AbstractVulnerability 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.
User login
