High-Throughput of SHA-256 Hash Function with Unfolding Transformation

Shamsiah, Binti Suhaili and Watanabe, Takahiro (2019) High-Throughput of SHA-256 Hash Function with Unfolding Transformation. In: 7th Global Conference on Engineering and Technology 2019, 6-7 December 2019, Penang, Malaysia.

[img] PDF
7th GCOET-Templet_Shamsiah27092019.docx

Download (340kB)

Abstract

Hash Function in cryptography algorithms is used to encrypt the message by giving the appropriate output based on the structure of the hash function itself. This algorithm is important for security application such as keyed-Hash Message Authentication Code (HMAC), digital signature and others. There are different types of hash function such as MD5, SHA-1, RIPEMD-160, SHA-256, SHA-224, SHA-384, SHA-512 and others. In this paper, the unfolding transformation method was proposed to improve the throughput of the SHA-256 hash function. Three types of SHA-256 hash function were designed namely SHA-256 design, SHA-256 design inner pipelining with unfolding factor 2 and SHA-256 design inner pipelining with unfolding factor 4. The designs were written in Verilog code and the output simulations were verified using ModelSim. The simulation results showed that the proposed SHA-256 inner pipelining unfolding with factor 4 provided the highest throughput which is 4196.30 Mbps, and with factor 2 was superior in terms of maximum frequency and was better than the conventional SHA-256 design.

Item Type: Proceeding (Paper)
Uncontrolled Keywords: Cryptography algorithm; FPGA; SHA-256 Hash Function; Unfolding transformation, Verilog, unimas, university, universiti, Borneo, Malaysia, Sarawak, Kuching, Samarahan, ipta, education, research, Universiti Malaysia Sarawak.
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: Academic Faculties, Institutes and Centres > Faculty of Engineering
Depositing User: Suhaili
Date Deposited: 17 Dec 2019 07:56
Last Modified: 17 Dec 2019 07:56
URI: http://ir.unimas.my/id/eprint/28328

Actions (For repository members only: login required)

View Item View Item