TY - JFULL AU - Sheena Mathew and K. Poulose Jacob PY - 2010/2/ TI - Performance Evaluation of Popular Hash Functions T2 - International Journal of Computer and Information Engineering SP - 64 EP - 68 VL - 4 SN - 1307-6892 UR - https://publications.waset.org/pdf/8127 PU - World Academy of Science, Engineering and Technology NX - Open Science Index 37, 2010 N2 - This paper describes the results of an extensive study and comparison of popular hash functions SHA-1, SHA-256, RIPEMD-160 and RIPEMD-320 with JERIM-320, a 320-bit hash function. The compression functions of hash functions like SHA-1 and SHA-256 are designed using serial successive iteration whereas those like RIPEMD-160 and RIPEMD-320 are designed using two parallel lines of message processing. JERIM-320 uses four parallel lines of message processing resulting in higher level of security than other hash functions at comparable speed and memory requirement. The performance evaluation of these methods has been done by using practical implementation and also by using step computation methods. JERIM-320 proves to be secure and ensures the integrity of messages at a higher degree. The focus of this work is to establish JERIM-320 as an alternative of the present day hash functions for the fast growing internet applications. ER -