TY - GEN
T1 - A high-performance hardware architecture for spectral hash algorithm
AU - Cheung, Ray C.C.
AU - Koç, Çetin Kaya
AU - Villasenor, John D.
PY - 2009
Y1 - 2009
N2 - The Spectral Hash algorithm is one of the Round 1 candidates for the SHA-3 family, and is based on spectral arithmetic over a finite field, involving multidimensional discrete Fourier transformations over a finite field, data dependent permutations, Rubic-type rotations, and affine and nonlinear functions. The underlying mathematical structures and operations pose interesting and challenging tasks for computer architects and hardware designers to create fast, efficient, and compact ASIC and FPGA realizations. In this paper, we present an efficient hardware architecture for the full 512-bit hash computation using the spectral hash algorithm. We have created a pipelined implementation on a Xilinx Virtex-4 XC4VLX200-11 FPGA which yields 100 MHz and occupies 38,328 slices, generating a throughput of 51.2 Gbps. Our fully parallel synthesized implementation shows that the spectral hash algorithm is about 100 times faster than the fastest SHA-1 implementation, while requiring only about 13 times as many logic slices. © 2009 IEEE.
AB - The Spectral Hash algorithm is one of the Round 1 candidates for the SHA-3 family, and is based on spectral arithmetic over a finite field, involving multidimensional discrete Fourier transformations over a finite field, data dependent permutations, Rubic-type rotations, and affine and nonlinear functions. The underlying mathematical structures and operations pose interesting and challenging tasks for computer architects and hardware designers to create fast, efficient, and compact ASIC and FPGA realizations. In this paper, we present an efficient hardware architecture for the full 512-bit hash computation using the spectral hash algorithm. We have created a pipelined implementation on a Xilinx Virtex-4 XC4VLX200-11 FPGA which yields 100 MHz and occupies 38,328 slices, generating a throughput of 51.2 Gbps. Our fully parallel synthesized implementation shows that the spectral hash algorithm is about 100 times faster than the fastest SHA-1 implementation, while requiring only about 13 times as many logic slices. © 2009 IEEE.
UR - https://www.scopus.com/pages/publications/71049160785
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-71049160785&origin=recordpage
U2 - 10.1109/ASAP.2009.31
DO - 10.1109/ASAP.2009.31
M3 - RGC 32 - Refereed conference paper (with host publication)
SN - 9780769537320
SP - 215
EP - 218
BT - Proceedings of the International Conference on Application-Specific Systems, Architectures and Processors
T2 - 2009 20th IEEE International Conference on Application-specific Systems, Architectures and Processors, ASAP 2009
Y2 - 7 July 2009 through 9 July 2009
ER -