Design And Implementation Of Five Candidate Algorithm Of SHA-3Based On FPGA

Hash function is a kind of One-Way Cryptosystem, which could transform the input into output fixed with any lengths, and it can build "digital fingerprint" by the performance of One-way and fixity of outputs. SHA-3as a new standard of HASH functions, was levied to the world officially by NIST in2007. Currently, the official result would be selected from the candidate algorithm in BLAKE、Gr(?)stl、JH、Skein and Keccak, by screened strictly from several rounds of selections. The new idea would indeed be the milestone of the Cryptography in the field of HASH function.The author has seriously studied five kinds of candidate algorithm for SHA-3. Based on conducted an in-depth research of Xilinx Virtex-Ⅱ Pro development platform and the hardware implementation of hash functions, five kinds of candidate algorithm for SHA-3are implemented and verified with optimization in the Xilinx Virtex-Ⅱ Pro FPGA board by VHDL.The analysis for comparing the five kinds of algorithm shows that:Before optimization, Gr(?)stl occupied the minimal system resources, only1892slice, Keccak is the fastest algorithm, the calculating speed can reached8568.51Mbps; After optimization, Keccak is still the fastest algorithm, and the calculating speed increased to8738.88Mbps, Skein occupied the minimal system resources, only3950slice. Considering the two factors of system resources and calculating speed, Keccak is the best of the five candidate algorithms.