Spectral Hash
Encyclopedia
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ç. It uses a Merkle-Damgard construction and employs several mathematical structures including Finite fields and Discrete Fourier transforms. The authors claims 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.
Cryptographic hash function
A cryptographic hash function is a deterministic procedure that takes an arbitrary block of data and returns a fixed-size bit string, the hash value, such that an accidental or intentional change to the data will change the hash value...
submitted to the NIST hash function competition
NIST hash function competition
The NIST hash function competition is an open competition held by the US National Institute of Standards and Technology for a new SHA-3 function to replace the older SHA-1 and SHA-2, which was formally announced in the Federal Register on November 2, 2007...
by Gokay Saldamlı, Cevahir Demirkıran, Megan Maguire, Carl Minden, Jacob Topper, Alex Troesch, Cody Walker, Çetin Kaya Koç. It uses a Merkle-Damgard construction and employs several mathematical structures including Finite fields and Discrete Fourier transforms. The authors claims 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.