Application of novel technique in RIPEMD-160 aiming at high-throughput

Abstract

Hash functions, form a special family of cryptographic algorithms that satisfy current requirements for security, confidentiality and validity for several applications in technology. Many applications like PKI, IPSec, DSA, MAC's need the requirements mentioned before. All the previous applications incorporate hash functions and address, as the time passes, to more and more users-clients and thus the increase of their throughput is quite necessary. In this paper we propose an implementation that increases throughput and frequency significantly and at the same time keeps the area small enough for the hash function RIPEMD-160, which is emanated from the necessity for existence of very strong algorithms in cryptanalysis. This technique involves the application of spatial and temporal pre-computation. The proposed technique leads to an implementation with more than 35% higher throughput. © 2008 IEEE.