期刊名称：International Journal of Computer Science & Information Technology (IJCSIT)
印刷版ISSN：0975-4660
电子版ISSN：0975-3826
出版年度：2012
卷号：4
期号：6
页码：159
出版社：Academy & Industry Research Collaboration Center (AIRCC)
摘要：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.
