ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Hardware evaluation of the Luffa hash family
Full text PdfPdf (358 KB)
Source International Conference on Compilers, Architecture and Synthesis for Embedded Systems archive
Proceedings of the 4th Workshop on Embedded Systems Security table of contents
Grenoble, France
Article No.: 9  
Year of Publication: 2009
ISBN:978-1-60558-700-4
Authors
Miroslav Knežević  Katholieke Universiteit Leuven, Leuven-Heverlee, Belgium
Ingrid Verbauwhede  Katholieke Universiteit Leuven, Leuven-Heverlee, Belgium
Sponsors
SIGMICRO: ACM Special Interest Group on Microarchitectural Research and Processing
: IEEE CS
SIGDA: ACM Special Interest Group on Design Automation
: IEEE CAS
CEDA : Council on Electronic Design Automation
SIGBED: ACM Special Interest Group on Embedded Systems
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 18,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1631716.1631725
What is a DOI?

ABSTRACT

Efficient hardware architectures for the Luffa hash algorithm are proposed in this work. We explore different tradeoffs and propose several architectures, targeting both compact and high-throughput designs. Implemented using UMC 0.13 μm CMOS standard cell library, the most compact architecture of Luffa-224/256 contains 18,260 GE. The same version, optimized for speed, achieves a throughput of almost 32 Gbps, while the throughput of the pipelined design approaches 291.7 Gbps. Concerning the final throughput, our implementations outperform state of the art implementations of the existing hash standards.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
C. D. Cannière, H. Sato, and D. Watanabe. Hash Function Luffa. In The First SHA-3 Candidate Conference, 2009.
2
 
3
M. Kim and J. Ryou. Power Efficient Hardware Architecture of SHA-1 Algorithm for Trusted Mobile Computing. In Information and Communications Security, Volume 4861/2008. LNCS, 2008.
 
4
 
5
Y. Lee, H. Chan, and I. Verbauwhede. Iteration Bound Analysis and Throughput Optimum Architecture of SHA-256 (384,512) for Hardware Implementations. In Information Security Applications, 8th International Workshop, WISA 2007, Lecture Notes in Computer Science 4867. LNCS, 2007.
 
6
K. K. Parhi. VLSI Digital Signal Processing Systems - Design and Implementation.
 
7
 
8
P. Schaumont and I. Verbauwhede. Domain-specific tools and methods for application in security processor design. In Kluwer Journal for Design Automation of Embedded Systems, 2002.
 
9
 
10
X. Wang, Y. L. Yin, and H. Yu. Finding Collisions in the Full SHA-1. In Advances in Cryptology, CRYPTO 2005, 2005.
 
11
X. Wang and H. Yu. How to Break MD5 and Other Hash Functions. In Advances in Cryptology, EUROCRYPT 2005, 2005.

Collaborative Colleagues:
Miroslav Knežević: colleagues
Ingrid Verbauwhede: colleagues