SIMD is acryptographic hash function based on theMerkle–Damgård construction submitted to theNIST hash function competition by Gaëtan Leurent. It is one of fourteen entries to be accepted into round two of the competition,[1] but was not shortlisted for the third and final round.[2]
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–13cycles per byte.[3]