Spectral hash is a new family of hash functions using the discrete Fourier transform and a nonlinear transformation constructed via data dependent permutations. DFT is a well-known cryptographic primitive perfect for generating diﬀusion and confusion. Due to the usage of the DFT with a nonlinear transformation, the proposed hash generation method is immune to known attacks. Since spectral methods yield eﬃcient and highly parallel architectures, s-hash is highly suitable for hardware realizations.
To view the full submission, go to the Materials page.
11-10-08: We have a website now!
01-15-09: The corrected code and documentation are available under "Materials" tab.
02-17-09: The inimitable CCS Spectral Hash Team: JPG
02-20-09: Our Spectral Hash presentation is on the NIST website: PDF.
G. Saldamlı, C. Demirkıran, M. Maguire, C. Minden, J. Topper, A. Troesch, C. Walker, and Ç. K. Koç. Spectral hash. The First SHA-3 Candidate Conference, Katholieke Universiteit, Leuven, Belgium, February 25-28, 2009. PDF