Two-Track-MAC

Two-Track-MAC algorithm has been selected as a finalist for NESSIE in November 2000 and was conceived as a fast and reliable method to hash data. The development was attended by Bart of Van Rompay ( Eng. ) From the Leuven University ( Katholieke Universiteit Leuven ) - Belgium and Bert den Boer of debis AG (Germany).

It uses two hash functions in parallel, making it similar to MDC-2.

External links

New (Two-Track-)MAC Based on the Two Trails of RIPEMD

Cryptographic hash functions & message authentication codes
List Comparison Known attacks
Common functions	MD5 (compromised) SHA-1 (compromised) SHA-2 SHA-3 BLAKE2
SHA-3 finalists	BLAKE Grøstl JH Skein Keccak (winner)
Other functions	BLAKE3 CubeHash ECOH FSB GOST HAS-160 HAVAL Kupyna LSH MASH-1 MASH-2 MD2 MD4 MD6 MDC-2 N-hash RIPEMD RadioGatún SM3 SWIFFT Snefru Streebog Tiger VSH Whirlpool
Password hashing/ key stretching functions	Argon2 Balloon bcrypt Catena crypt LM hash Lyra2 Makwa PBKDF2 scrypt yescrypt
General purpose key derivation functions	HKDF KDF1/KDF2
MAC functions	DAA CBC-MAC GMAC HMAC NMAC OMAC/CMAC PMAC VMAC UMAC Poly1305 SipHash
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 Sponge function HAIFA construction
Standardization	CRYPTREC NESSIE NIST hash function competition
Utilization	Hash-based cryptography Merkle tree Message authentication Proof of work Salt Pepper

Cryptography
History of cryptography Cryptanalysis Outline of cryptography
Symmetric-key algorithm Block cipher Stream cipher Public-key cryptography Cryptographic hash function Message authentication code Random numbers Steganography
Category

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.