Spectral Hash

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ç.{{cite web

|title=Spectral Hash

|url=http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/Feb2009/documents/spectral-koc.pdf

|author=Çetin Kaya Koç

|publisher=Computer Security Resource Center, NIST

|date=2017-01-04

}}{{cite web

|title=First SHA-3 Candidate Conference

|date=25–28 February 2009

|url=http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/Feb2009/program.html

|publisher=Computer Security Resource Center, NIST

}}{{cite book

|pages=215–218

|year=2009

|doi=10.1109/ASAP.2009.31

|author1=Ray C.C. Cheung |author2=Çetin K. Koç |author3=John D. Villasenor |title=2009 20th IEEE International Conference on Application-specific Systems, Architectures and Processors

|chapter=A High-Performance Hardware Architecture for Spectral Hash Algorithm

|s2cid=15221666

}} 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.{{cite web

|url=http://ehash.iaik.tugraz.at/uploads/4/4b/Spectralhash_heilman.txt

|title=Collision for Spectral Hash

|last=Heilman |first=Ethan

|date=2009-03-12

|accessdate=19 May 2009

}}