%0 Journal Article
%T R-Hash: Hash Function Using Random Quadratic Polynomials Over GF(2)
%A Dhananjoy Dey
%A Noopur Shrotriya
%A Indranath Sengupta
%J International Journal of Computer Science & Information Technology
%D 2013
%I Academy & Industry Research Collaboration Center (AIRCC)
%X In this paper we describe an improved version of HF-hash [7] viz. R-hash: Hash Function Using RandomQuadratic Polynomials Over GF(2). The compression function of HF-hash consists of 32 polynomials with64 variables over GF(2), which were taken from the first 32 polynomials of HFE challenge-1 by forcinglast 16 variables as 0. The mode operation used in computing HF-hash was Merkle-Damgard. We haverandomly selected 32 quadratic non-homogeneous polynomials having 64 variables over GF(2) in case ofR-hash to improve the security of the compression function used in HF-hash. In designing R-hash, we havealso changed the mode operation used in HF-hash, because of the theoretical weakness found in theMerkle-Damgard construction.In this paper we will prove that R-hash is more secure than HF-hash and SHA-256 as well as we will showthat it is also faster than HF-hash.
%K Dedicated hash functions
%K differential attack
%K MQ problem
%K preimage attack.
%U http://airccse.org/journal/jcsit/4612ijcsit12.pdf