Poulose Jacob,K; Sheena, Mathew(Technomathematics Research Foundation, 2008)
[+]
[-]
Abstract:
This paper describes JERIM-320, a new 320-bit hash function used for ensuring message integrity
and details a comparison with popular hash functions of similar design. JERIM-320 and FORK -256
operate on four parallel lines of message processing while RIPEMD-320 operates on two parallel
lines. Popular hash functions like MD5 and SHA-1 use serial successive iteration for designing
compression functions and hence are less secure. The parallel branches help JERIM-320 to achieve
higher level of security using multiple iterations and processing on the message blocks. The focus of
this work is to prove the ability of JERIM 320 in ensuring the integrity of messages to a higher
degree to suit the fast growing internet applications
Description:
International Journal of Computer Science and Applications,
Vol. 5, No. 4, pp 11 - 25, 2008