Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
SIMD (hash function)
open-in-new
<p>SIMD is a <a href="/facts/Cryptographic_hash_function/cuxkgbST">cryptographic hash function</a> based on the <a href="/facts/Merkle%25E2%2580%2593Damg%25C3%25A5rd_construction/nEuAJBAs">Merkle–Damgård construction</a> submitted to the <a href="/facts/NIST_hash_function_competition/DFxbPNbx">NIST hash function competition</a> 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. </p><p>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 <a href="/facts/Cycles_per_byte/Dc39822I">cycles per byte</a>. </p>