SIMD (hash function)

---

title: "SIMD (hash function)" type: doc version: 1 created: 2026-02-28 author: "Wikipedia contributors" status: active scope: public tags: ["nist-hash-function-competition"] description: "Cryptographic hash function" topic_path: "general/nist-hash-function-competition" source: "https://en.wikipedia.org/wiki/SIMD_(hash_function)" license: "CC BY-SA 4.0" wikipedia_page_id: 0 wikipedia_revision_id: 0

::summary Cryptographic hash function ::

SIMD is a cryptographic hash function based on the Merkle–Damgård construction submitted to the NIST hash function competition by Gaëtan Leurent. It is one of fourteen entries to be accepted into round two of the competition, but was not shortlisted for the third and final round.

The designer states that the "most important component of SIMD is its message expansion, which is designed to give a high minimal distance". The algorithm's speed is claimed to be 11–13 cycles per byte.

References

References

1. "Second Round Candidates". Computer Security Resource Center, [[National Institute of Standards and Technology]].
2. "Third (Final) Round Candidates". Computer Security Resource Center, National Institute of Standards and Technology.
3. Leurent, Gaëtan. "The SIMD Hash Function".

::callout[type=info title="Wikipedia Source"] This article was imported from Wikipedia and is available under the Creative Commons Attribution-ShareAlike 4.0 License. Content has been adapted to SurfDoc format. Original contributors can be found on the article history page. ::