You are looking at a specific version 20121009:091925 of this paper. See the latest version.

Paper 2011/450

R-hash : Hash Function Using Random Quadratic Polynomials Over GF (2)

Dhananjoy Dey, Noopur Shrotriya, Indranath Sengupta

Abstract

In this paper we present an improved version of HF-hash [4] viz. R-hash : Hash Function Using Random Quadratic Polynomials Over GF(2). 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. Merkle-Damg°ard mode operation was used in computation of HF-hash. In R-hash, we have randomly selected 32 quadratic non-homogeneous polynomials with 64 variables over GF(2) to improve the security of the compression function used in HF-hash. We have also changed the design principle of HF-hash because of the theoretical weakness found in the Merkle-Damg°ard construction. In this paper we will prove that R-hash is more secure and much more efficient than HF-hash.

Note: This paper is accepted for publication on IJCST. Editorial borad requires the copy-right.

Metadata
Available format(s)
-- withdrawn --
Publication info
Published elsewhere. Accepted for publication on IJCSIT
Keywords
Dedicated hash functionsdifferential attackMQ problempreimage attack.
Contact author(s)
ddey06 @ gmail com
History
2012-10-09: withdrawn
2011-08-20: received
See all versions
Short URL
https://ia.cr/2011/450
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.