Spectral Hash Explained

Spectral Hash is a cryptographic hash function submitted to the NIST hash function competition by Gokay Saldamlı, Cevahir Demirkıran, Megan Maguire, Carl Minden, Jacob Topper, Alex Troesch, Cody Walker, Çetin Kaya Koç.^{[1] [2] [3]} It uses a Merkle–Damgård construction and employs several mathematical structures including finite fields and discrete Fourier transforms. The authors claim 512-bit hashes at 51.2 gigabits per second on a 100-MHz Virtex-4 FPGA.

Spectral hash is insecure; a method exists to generate arbitrary collisions in the hash state, and therefore in the final hash digest.^[4]

See also

• BLAKE
• Grøstl (Knudsen et al.)
• JH
• Keccak (Keccak team, Daemen et al.)
• Skein (Schneier et al.)

External links

• The Spectral Hash web site

Notes and References

1. Web site: Spectral Hash . Çetin Kaya Koç . . 2017-01-04 .
2. Web site: First SHA-3 Candidate Conference . 25–28 February 2009 . Computer Security Resource Center, NIST.
3. Book: 215–218 . 2009 . 10.1109/ASAP.2009.31 . Ray C.C. Cheung . Çetin K. Koç . John D. Villasenor . 2009 20th IEEE International Conference on Application-specific Systems, Architectures and Processors . A High-Performance Hardware Architecture for Spectral Hash Algorithm . 15221666 .
4. Web site: Collision for Spectral Hash . Heilman . Ethan . 2009-03-12 . 19 May 2009.