On the high-throughput implementation of RIPEMD-160 hash algorithm
M. Knezzevic, Kazuo Sakiyama, Y. K. Lee, Ingrid M.R. Verbauwhede · 2008
In this paper we present two new architectures of the RIPEMD-160 hash algorithm for high throughput implementations. The first architecture achieves the iteration bound of RIPEMD-160, i.e. it achieves a theoretical upper bound on throughput at the micro-architecture level. The second architecture is designed by performing a gate level optimization and achieves a better performance than the first one at the cost of a larger gate area. Throughputs of 3.122 Gbps and 624 Mbps are achieved, with and without pipelining, respectively.