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

  • H. E. Michail
  • A. P. Kakarountas
  • George N. Selimis
  • Costas E. Goutis
Conference paper

DOI: 10.1007/11556930_60

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3728)
Cite this paper as:
Michail H.E., Kakarountas A.P., Selimis G.N., Goutis C.E. (2005) Optimizing SHA-1 Hash Function for High Throughput with a Partial Unrolling Study. In: Paliouras V., Vounckx J., Verkest D. (eds) Integrated Circuit and System Design. Power and Timing Modeling, Optimization and Simulation. PATMOS 2005. Lecture Notes in Computer Science, vol 3728. Springer, Berlin, Heidelberg

Abstract

Hash functions are widely used in applications that call for data integrity and signature authentication at electronic transactions. A hash function is utilized in the security layer of every communication protocol. As time passes more sophisticated applications arise that address to more users-clients and thus demand for higher throughput. Furthermore, due to the tendency of the market to minimize devices’ size and increase their autonomy to make them portable, power issues have also to be considered. 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 implementation comes to exceed this limit improving the throughput by 53%. Furthermore,power dissipation is kept low compared to previous works, in such way that the proposed implementation can be characterized as low-power.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • H. E. Michail
    • 1
  • A. P. Kakarountas
    • 1
  • George N. Selimis
    • 1
  • Costas E. Goutis
    • 1
  1. 1.Electrical & Computer Engineering DepartmentUniversity of PatrasPatrasGreece

Personalised recommendations