Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.14279/1898
Title: | Speeded up and low-powered hardware implementation of the secure hash algorithm through partial unrolling | Authors: | Michail, Harris Kakarountas, Athanasios P. Theodoridis, Georgios A. |
metadata.dc.contributor.other: | Μιχαήλ, Χάρης | Major Field of Science: | Engineering and Technology | Field Category: | Electrical Engineering - Electronic Engineering - Information Engineering | Keywords: | Algorithms;Electronic commerce;Data integrity;Hardware | Issue Date: | Jul-2005 | Source: | WSEAS Transactions on Computers, 2005, vol. 4, no. 7, pp. 814-821 | Volume: | 4 | Issue: | 7 | Start page: | 814 | End page: | 821 | Journal: | WSEAS Transactions on Computers | Abstract: | Applications that call for data integrity and signature authentication at electronic transactions invoke cryptographic primitives like hash functions. A hash function is utilized in the security layer of every communication protocol. However, as protocols evolve and new high-performance applications appear, the throughput of hash functions seems to reach to a limit. Market is asking for new implementations with higher throughputs respecting the tendency of the market to minimize devices' size and increase their autonomy to make them portable. The existing SHA-1 Hash Function implementations (SHA-1 is common in many protocols e.g. IPSec) limit throughput to a maximum of 2 Gbps. In this paper, a new a partially unrolled implementation is presented that comes to exceed this limit improving the throughput by 53%. Power issues have also been taken in consideration, in such way that the proposed implementation can be characterized as low-power. | URI: | https://hdl.handle.net/20.500.14279/1898 | ISSN: | 11092750 | Rights: | © WSEAS | Type: | Article | Affiliation: | University of Patras | Affiliation : | University of Patras Aristotle University of Thessaloniki |
Publication Type: | Peer Reviewed |
Appears in Collections: | Άρθρα/Articles |
CORE Recommender
This item is licensed under a Creative Commons License