SIMD (hash function)

For the computer hardware feature, see SIMD.

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,^[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-13 cycles per byte.^[3]

References

↑ "Second Round Candidates". Computer Security Resource Center, National Institute of Standards and Technology. Retrieved 2009-07-25.
↑ "Third (Final) Round Candidates". Computer Security Resource Center, National Institute of Standards and Technology. Retrieved 2011-05-04.
↑ Leurent, Gaëtan. "The SIMD Hash Function". Retrieved 2009-07-25.

Cryptographic hash functions & message authentication codes

List Comparison Known attacks

Common functions	MD5 SHA-1 SHA-2 SHA-3 BLAKE2 SipHash

SHA-3 finalists	BLAKE Grøstl JH Skein Keccak (winner)

Other functions	ECOH FSB GOST HAS-160 HAVAL Kupyna LM hash MD2 MD4 MD5 MD6 MDC-2 N-Hash RIPEMD RadioGatún SWIFFT Snefru Streebog Tiger VSH WHIRLPOOL

Key derivation functions	bcrypt crypt PBKDF2 scrypt Argon2 Lyra2

MAC functions	DAA CBC-MAC HMAC OMAC/CMAC PMAC VMAC UMAC Poly1305

Authenticated encryption modes	CCM CWC EAX GCM IAPM OCB

Attacks	Collision attack Preimage attack Birthday attack Brute force attack Rainbow table Side-channel attack Length extension attack

Design	Avalanche effect Hash collision Merkle–Damgård construction

Standardization	CRYPTREC NESSIE NIST hash function competition

Utilization	Hash-based cryptography Key stretching Merkle tree Message authentication Proof of work Salt

This article is issued from Wikipedia - version of the 5/4/2011. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.