论文信息 - FPGA Implementations of SHA-3 Candidates: CubeHash, Grøstl, LANE, Shabal and Spectral Hash

FPGA Implementations of SHA-3 Candidates: CubeHash, Grøstl, LANE, Shabal and Spectral Hash

Hash functions are widely used in, and form an important part of many cryptographic protocols. Currently, a public competition is underway to find a new hash algorithm(s) for inclusion in the NIST Secure Hash Standard (SHA-3). Computational efficiency of the algorithms in hardware will form one of the evaluation criteria. In this paper, we focus on five of these candidate algorithms, namely CubeHash, Grostl, LANE, Shabal and Spectral Hash. Using Xilinx Spartan-3 and Virtex-5 FPGAs, we present architectures for each of these hash functions, and explore area-speed trade-offs in each design. The efficiency of various architectures for the five hash functions is compared in terms of throughput per unit area. To the best of the authors' knowledge, this is the first such comparison of these SHA-3 candidates in the literature.

[1] J. Leasure,et al. Announcing request for candidate algorithm nominations for a new cryptographic hash algorithm (SHA-3 , 2007 .

[2] Patrick Schaumont,et al. A Hardware Interface for Hashing Algorithms , 2008, IACR Cryptol. ePrint Arch..

[3] Ray C. C. Cheung,et al. An Efficient Hardware Architecture for Spectral Hash Algorithm , 2009 .

[4] Milos Drutarovský,et al. Two Methods of Rijndael Implementation in Reconfigurable Hardware , 2001, CHES.

[5] Bart Preneel,et al. The Lane hash function , 2009, Symmetric Cryptography.

[6] Florian Mendel,et al. Symmetric Cryptography , 2009 .

[7] Xiaoyun Wang,et al. Finding Collisions in the Full SHA-1 , 2005, CRYPTO.

[8] Ray C. C. Cheung,et al. A High-Performance Hardware Architecture for Spectral Hash Algorithm , 2009, 2009 20th IEEE International Conference on Application-specific Systems, Architectures and Processors.