Title
Design Methodology for Throughput Optimum Architectures of Hash Algorithms of the MD4-class
Abstract
In this paper we propose an architecture design methodology to optimize the throughput of MD4-based hash algorithms. The proposed methodology includes an iteration bound analysis of hash algorithms, which is the theoretical delay limit, and Data Flow Graph transformations to achieve the iteration bound. We applied the methodology to some MD4-based hash algorithms such as SHA1, MD5 and RIPEMD-160. Since SHA1 is the algorithm which requires all the techniques we show, we also synthesized the transformed SHA1 algorithm in a 0.18 μm CMOS technology in order to verify its correctness and its achievement of high throughput. To the best of our knowledge, the proposed SHA1 architecture is the first to achieve the theoretical throughput optimum beating all previously published results. Though we demonstrate a limited number of examples, this design methodology can be applied to any other MD4-based hash algorithm.
Year
DOI
Venue
2008
10.1007/s11265-008-0168-8
Signal Processing Systems
Keywords
Field
DocType
Architecture design methodology,Throughput optimization,MD4-based hash algorithm,SHA1,MD5,RIPEMD-160,Iteration bound analysis,DFG (Data Flow Graph) transformation
RIPEMD,Computer science,Parallel computing,Correctness,Data-flow analysis,Algorithm,Design methods,MD4,Hash function,Throughput,MD5
Journal
Volume
Issue
ISSN
53
1-2
1939-8018
Citations 
PageRank 
References 
3
0.49
15
Authors
3
Name
Order
Citations
PageRank
Yong Ki Lee117410.12
Herwin Chan2284.87
Ingrid Verbauwhede34650404.57