Area-throughput trade-offs for SHA-1 and SHA-256 hash functions’ pipelined designs

MICHAIL, Harris E., ATHANASIOU, George S., KELEFOURAS, Vasileios, THEODORIDIS, George, STOURAITIS, Thanos and GOUTIS, Costas E. (2015). Area-throughput trade-offs for SHA-1 and SHA-256 hash functions’ pipelined designs. Journal of Circuits, Systems and Computers, 25 (04), p. 1650032.

harris_new.pdf - Accepted Version
All rights reserved.

Download (7MB) | Preview
Official URL:
Link to published version::
Related URLs:


    High-throughput designs of hash functions are strongly demanded due to the need for security in every transmitted packet of worldwide e-transactions. Thus, optimized and non-optimized pipelined architectures have been proposed raising, however, important questions. Which is the optimum number of the pipeline stages? Is it worth to develop optimized designs or could the same results be achieved by increasing only the pipeline stages of the non-optimized designs? The paper answers the above questions studying extensively many pipelined architectures of SHA-1 and SHA-256 hashes, implemented in FPGAs, in terms of throughput/area (T/A) factor. Also, guides for developing efficient security schemes designs are provided. Read More:

    Item Type: Article
    Uncontrolled Keywords: Hash function; message authentication code; pipeline; FPGA, security
    Departments - Does NOT include content added after October 2018: Faculty of Science, Technology and Arts > Department of Computing
    Identification Number:
    Page Range: p. 1650032
    Depositing User: Vasileios Kelefouras
    Date Deposited: 27 Mar 2018 09:33
    Last Modified: 30 Jun 2020 18:00

    Actions (login required)

    View Item View Item


    Downloads per month over past year

    View more statistics