Advertisement

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

  • Nan Kyoung Park
  • Joon Ho Hwang
  • Pil Joong Lee
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2012)

Abstract

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.

Keywords

Boolean Function Hash Function Unit Operation Block Cipher Compression Function 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    B. den Boer and A. Bosselaers, An attack on the last two rounds of MD4, Advances in Cryptology-Crypto’91, LNCS 576, Springer-Verlag, 1992, pp.194–203.Google Scholar
  2. 2.
    B. den Boer and A. Bosselaers, Collisions for the compression function of MD5, Advances in Cryptology-Eurocrypt’93, LNCS 773, Springer-Verlag, 1994, pp.293–304.Google Scholar
  3. 3.
    A. Bosselaers, R. Govaerts and J. Vandewalle, Fast hashing on the Pentium, Advances in Cryptology-Crypto’96, LNCS 1109, Springer-Verlag, 1996, pp.298–312.Google Scholar
  4. 4.
    A.Bosselares, R. Govarerts and J. Vandewalle, SHA: a design for parallel architecture, Advances in Cryptology-Eurocrypt’97, 1997, pp.348–362.Google Scholar
  5. 5.
    F. Chabaud and A. Joux, Differential collisions in SHA-0, Advances in Cryptology-Crypto’98, LNCS 1462, Springer-Verlag, 1998, pp.56–71.CrossRefGoogle Scholar
  6. 6.
    I.B. Damgård, A design principle for hash functions, Proceedings of Crypto ’89, LNCS 435, Springer-Verlag, 1990, pp. 416–427.Google Scholar
  7. 7.
    H. Dobbertin, Cryptanalysis of MD4, Fast Software Encryption, LNCS 1039, Springer-Verlag, 1996, pp.53–69.Google Scholar
  8. 8.
    H. Dobbertin, The status of MD5 after a recent attack, CryptoBytes, 2(2), Sep. 1996, pp.1–6.MathSciNetGoogle Scholar
  9. 9.
    H. Dobbertin, A. Bosselaers and B. Preneel, RIPEMD160: A strengthened version of RIPEMD, Fast Software Encryption, LNCS1039, Springer-Verlag, 1996, pp.71–82. (An updated and corrected version is available at http://ftp.esat.kuleuven.ac.be,/pub/COSIC/bosselae/ripemd/.)Google Scholar
  10. 10.
    C.H. Lim and P.J. Lee, A study on the proposed Korean digital signature algorithm, Advances in Cryptology-Asiacrypt’98, LNCS 1514, Springer-Verlag, 1998, pp. 175–186.CrossRefGoogle Scholar
  11. 11.
    NIST, Secure hash standard, FIPS PUB 180-1, Department of Commerce, Washington D.C., Apr. 1995.Google Scholar
  12. 12.
    P.C. van Oorchot and M.J. Wiener, Parallel collision search with applications to hash functions and discrete logarithms. Proc. of 2nd ACM Conference on Computer and Communications Security, ACM Press, 1994, pp.210–218.Google Scholar
  13. 13.
    B. Preneel, Analysis and design of crytpographic hash functions, PHD thesis, Katholiceke University Leuven, 1993.Google Scholar
  14. 14.
    R. Rivest, The MD4 message digest algorithm, Advances in Cryptology-Crypto’90, LNCS 537, Springer-Verlag, 1991, pp.303–311.Google Scholar
  15. 15.
    R.Rivest, The MD5 message digest algorithm, RFC 1321, Internet Activities Board, Internet Privacy Task Force, Apr. 1992.Google Scholar
  16. 16.
    J. Seberry and X.M. Zhang, Highly nonlinear 0-1 balanced boolean functions satisfying strict avalanche criterion, Advances in Cryptology-Auscrypt’92, LNCS 718, Springer-Verlag, 1993, pp.145–154.Google Scholar
  17. 17.
    J. Seberry, X.M. Zhang and Y. Zheng, Nonlinearity and propagation characteristics of balanced boolean functions, Information and Computation, 119, 1995, pp.1–13.zbMATHCrossRefMathSciNetGoogle Scholar
  18. 18.
    G. Yuval, How to swindle Rabin, Cryptologia, Vol. 3, No. 3, 1979, pp.187–189.CrossRefGoogle Scholar
  19. 19.
    Y. Zheng, J. Pieprzyk and J. Sebberry, HAVAL-A one-way hashing algorithm with variable length of output, Advances in Cryptology-Auscrypt’92, LNCS 718, Springer-Verlag, 1993, pp.83–104.Google Scholar

Copyright information

© Springer-VerlagBerlin Heidelberg 2001

Authors and Affiliations

  • Nan Kyoung Park
    • 1
  • Joon Ho Hwang
    • 1
  • Pil Joong Lee
    • 1
  1. 1.Pohang University of Science and Technology(POSTECH)PohangKorea

Personalised recommendations