2005
DOI: 10.1007/11556930_60
|View full text |Cite
|
Sign up to set email alerts
|

Optimizing SHA-1 Hash Function for High Throughput with a Partial Unrolling Study

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
7
0

Year Published

2006
2006
2015
2015

Publication Types

Select...
5
3
1

Relationship

1
8

Authors

Journals

citations
Cited by 9 publications
(7 citation statements)
references
References 3 publications
0
7
0
Order By: Relevance
“…Some other works [25], [26], [27] provide further comparisons of FPGA-based implementations of hash functions. Also, some optimizations based on pipelining, loop unrolling, operation rescheduling and hardware reutilization are proposed in [28], [29]. Previous research has extensively addressed the implementation of the SHA-2 family of hash functions.…”
Section: Related Workmentioning
confidence: 99%
“…Some other works [25], [26], [27] provide further comparisons of FPGA-based implementations of hash functions. Also, some optimizations based on pipelining, loop unrolling, operation rescheduling and hardware reutilization are proposed in [28], [29]. Previous research has extensively addressed the implementation of the SHA-2 family of hash functions.…”
Section: Related Workmentioning
confidence: 99%
“…Efforts for optimisation have been paid for both SHA-1 and SHA-256 (Yiakoumis et al, 2006;Michail et al, 2005) which are the most widely deployed hash functions. In this work, the authors propose an optimisation for RIPEMD-160.…”
Section: Introductionmentioning
confidence: 99%
“…SHA-O, SHA-l [12], SHA-2 [10,11,15] and SHA-3 [19,21,22] belongs to SHA-x family. Secure Hash Algorithm (SHA) is commonly referred to as SHA-O.…”
Section: Introductionmentioning
confidence: 99%