Two-Track-MAC - Wikipedia

You can help expand this article with text translated from the corresponding article in Russian. (November 2016) Click [show] for important translation instructions.

View a machine-translated version of the Russian article.
Machine translation, like DeepL or Google Translate, is a useful starting point for translations, but translators must follow the LLM translation guideline, revise errors as necessary and confirm that the translation is accurate, rather than simply copy-pasting machine-translated text into the English Wikipedia.
Do not translate text that appears unreliable or low-quality. If possible, verify the text with references provided in the foreign-language article.
You must provide copyright attribution in the edit summary accompanying your translation by providing an interlanguage link to the source of your translation. A model attribution edit summary is Content in this edit is translated from the existing Russian Wikipedia article at [[:ru:Two-Track-MAC]]; see its history for attribution.
You may also add the template {{Translated|ru|Two-Track-MAC}} to the talk page.
For more guidance, see Wikipedia:Translation.

Two-Track-MAC is a message authentication code submitted to the NESSIE project in 2000 by Bart Van Rompay (KU Leuven) and Bert den Boer (debis AG).^[1] It is based on a dual-track hashing structure derived from RIPEMD, in which two parallel computation paths are combined to produce the final MAC.^[2]

It uses a dual-track structure derived from RIPEMD, in which two parallel computation paths are combined. This is superficially similar to constructions such as MDC-2, which also employ parallel processing, though the underlying designs differ significantly.^[2]

References

[edit]

↑ Preneel, Bart; Van Rompay, Bart; Granboulan, Louis; Martinet, Guillaume; Murphy, Sean; Shipsey, Rachel; White, James (September 2001). NESSIE Phase I: Selection of Primitives (PDF) (Report). NESSIE Project. Retrieved 2026-03-21.
1 2 den Boer, Bert; Van Rompay, Bart; Preneel, Bart; Vandewalle, Joos (2001). "New (two-track-) MAC based on the two trails of RIPEMD: Efficient, especially on short messages and for frequent key-changes". Selected Areas in Cryptography. Lecture Notes in Computer Science. Vol. 2259. Springer Publishing. pp. 314–324. doi:10.1007/3-540-45537-X_25.

v t e Cryptographic hash functions and 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 Fugue GOST HAS-160 HAVAL Kupyna LSH Lane MASH-1 MASH-2 MD2 MD4 MD6 MDC-2 N-hash RIPEMD RadioGatún SIMD SM3 SWIFFT Shabal 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	CBC-MAC DAA GMAC HMAC NMAC OMAC/CMAC PMAC Poly1305 SipHash UMAC VMAC
Authenticated encryption modes	CCM ChaCha20-Poly1305 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	CAESAR Competition CRYPTREC NESSIE NIST hash function competition Password Hashing Competition NSA Suite B CNSA
Utilization	Hash-based cryptography Merkle tree Message authentication Proof of work Salt Pepper

v t e Cryptography
General	History of cryptography Outline of cryptography Classical cipher Cryptographic protocol Authentication protocol Cryptographic primitive Cryptanalysis Cryptocurrency Cryptosystem Cryptographic nonce Cryptovirology Hash function Cryptographic hash function Key derivation function Secure Hash Algorithms Digital signature Kleptography Key (cryptography) Key exchange Key generator Key schedule Key stretching Keygen Machines Ransomware Random number generation Cryptographically secure pseudorandom number generator (CSPRNG) Pseudorandom noise (PRN) Secure channel Insecure channel Subliminal channel Encryption Decryption End-to-end encryption Harvest now, decrypt later Information-theoretic security Plaintext Codetext Ciphertext Shared secret Trapdoor function Trusted timestamping Key-based routing Onion routing Garlic routing Kademlia Mix network
Mathematics	Cryptographic hash function Block cipher Stream cipher Symmetric-key algorithm Authenticated encryption Public-key cryptography Quantum key distribution Quantum cryptography Post-quantum cryptography Message authentication code Random numbers Steganography
Category

This cryptography-related article is a stub. You can help Wikipedia by adding missing information.

This page was redesigned at the edge.

References