HAS-V: A New Hash Function with Variable Output Length

Hash functions play an essential role in many areas of cryptographic applications such as digital signature, authentication, and key derivation. In this paper, we propose a new hash function with variable output length, namely HAS-V, to meet the needs of various security levels desired among different applications. A great deal of attention was paid to balance the characteristics of security and performance. The use of message expansion, 4-variable Boolean functions, variable and fixed amounts of shifts, and interrelated parallel lines provide a high level of security for HAS-V. Experiments show that HAS-V is about 19% faster than SHA-1, 31% faster than RIPEMD-160, and 26% faster than HAVAL on a Pentium PC.

[1]  Air Force Air Force Materiel Command Hq.  FIPS-PUB-180-1 , 1995 .

[2]  Jennifer Seberry,et al.  Advances in Cryptology — AUSCRYPT '92 , 1992, Lecture Notes in Computer Science.

[3]  Gerhard Goos,et al.  Fast Software Encryption , 2001, Lecture Notes in Computer Science.

[4]  Antoine Joux,et al.  Differential Collisions in SHA-0 , 1998, CRYPTO.

[5]  Hans Dobbertin.  Cryptanalysis of MD4 , 1996, FSE.

[6]  Paul C. van Oorschot,et al.  Parallel collision search with application to hash functions and discrete logarithms , 1994, CCS '94.

[7]  Ronald L. Rivest,et al.  The MD5 Message-Digest Algorithm , 1992, RFC.

[8]  Michael Wiener,et al.  Advances in Cryptology — CRYPTO’ 99 , 1999 .

[9]  Ronald L. Rivest,et al.  The MD4 Message-Digest Algorithm , 1990, RFC.

[10]  Joos Vandewalle,et al.  SHA: A Design for Parallel Architectures? , 1997, EUROCRYPT.

[11]  Chae Hoon Lim,et al.  A Study on the Proposed Korean Digital Signature Algorithm , 1998, ASIACRYPT.

[12]  Neal Koblitz,et al.  Advances in Cryptology — CRYPTO ’96 , 2001, Lecture Notes in Computer Science.

[13]  Gideon Yuval,et al.  How to Swindle Rabin , 1979, Cryptologia.

[14]  Joos Vandewalle,et al.  Fast Hashing on the Pentium , 1996, CRYPTO.

[15]  Hugo Krawczyk,et al.  Advances in Cryptology - CRYPTO '98 , 1998 .

[16]  Antoon Bosselaers,et al.  An Attack on the Last Two Rounds of MD4 , 1991, CRYPTO.

[17]  Jennifer Seberry,et al.  Highly Nonlinear 0-1 Balanced Boolean Functions Satisfying Strict Avalanche Criterion , 1992, AUSCRYPT.

[18]  Joan Feigenbaum,et al.  Advances in Cryptology-Crypto 91 , 1992 .

[19]  Ivan Damgård,et al.  A Design Principle for Hash Functions , 1989, CRYPTO.

[20]  Jennifer Seberry,et al.  Nonlinearity and Propagation Characteristics of Balanced Boolean Functions , 1995, Inf. Comput..

[21]  Antoon Bosselaers,et al.  Collisions for the Compressin Function of MD5 , 1994, EUROCRYPT.

[22]  Bart Preneel,et al.  RIPEMD-160: A Strengthened Version of RIPEMD , 1996, FSE.

[23]  Tor Helleseth,et al.  Advances in Cryptology — EUROCRYPT ’93 , 2001, Lecture Notes in Computer Science.

[24]  Jennifer Seberry,et al.  HAVAL - A One-Way Hashing Algorithm with Variable Length of Output , 1992, AUSCRYPT.

[25]  Kazuo Ohta,et al.  Advances in Cryptology — ASIACRYPT’98 , 2002, Lecture Notes in Computer Science.