文章基本信息

标题：FPGA Based Area And Throughput Implementation of JH And BLAKE Hash Function
本地全文：下载
作者：Vaibhav Doshi ; Richa Arya ; Rajesh Kumar Yadav 等
期刊名称：International Journal of Computer Trends and Technology
电子版ISSN：2231-2803
出版年度：2012
卷号：3
期号：2-2
出版社：Seventh Sense Research Group
摘要：Implementation of area and throughput of the main building block (compression function) for two SHA3 candidates BLAKE and JH hash function. The National Institute of Standards and Technology (NIST) has started a competition for a new secure hash standard. A significant comparison between the submitted candidates is only possible, if third party implementations of all proposed hash functions are provided[5]. The BLAKE family contains the four hash function BLAKE28, BLAKE32, BLAKE48, BLAKE64 with the bit length of their digests being 224,256,384 and 512 , respectively and JH contains JH224, JH256, JH384, JH512.We use the proposed block diagram of JH and BLAKE compression function and find fixed size message digest from binary string of arbitrary length. The compression function of BLAKE256 takes as the input four values chain value(h) , message block(m), salt(s) and counter(t). AES design methodology is used in JH design and the BLAKE hash function HAIFA iteration mode[7]. In this paper FPGA implementation is based on two cryptographic hash function candidates BLAKE[6] and JH. and also compare the functions which is used in JH and BLAKE and then extract the important advantages, limitations, algorithms and design principals of both candidates.
关键词：SHA-3; JH ; BLAKE ; Hash; Compression Function