A message authentication code, or MAC, is a short tag computed from a message and a shared secret key that lets the holders of that key verify both the integrity of the message and that it originated from someone who knows the key, without providing the non-repudiation a digital signature offers to third parties. HMAC, which wraps a cryptographic hash function such as SHA-256 in a keyed construction, and Poly1305, a MAC often paired with the ChaCha20 stream cipher, are widely cited examples. A MAC is checked by recomputing the tag from the received message and key and comparing it to the tag that accompanied the message.
Browse By
Message Authentication Code
Filter Results4 entries
Sources
Message authentication code - Wikipedia
Lead sectionQuote, Lead section
In cryptography, a message authentication code (MAC), sometimes known as an authentication tag, is a short piece of information used for authenticating and integrity-checking a message.
Time-based one-time password (Wikipedia)
Has Member: Time-based one-time password, LeadQuote, Has Member: Time-based one-time password, Lead
Time-based one-time password (TOTP) is a computer algorithm that generates a one-time password (OTP) using the current time as a source of uniqueness.
CBC-MAC (Wikipedia)
Has Member: CBC-MAC, LeadQuote, Has Member: CBC-MAC, Lead
is a technique for constructing a message authentication code (MAC) from a block cipher.
IETF RFC Editor: RFC 2104: HMAC: Keyed-Hashing for Message Authentication
IETF RFC EditorHas Member: HMAC Algorithm, AbstractQuote, Has Member: HMAC Algorithm, Abstract
This document describes HMAC, a mechanism for message authentication using cryptographic hash functions.
IETF RFC Editor: RFC 8439: ChaCha20 and Poly1305 for IETF Protocols
IETF RFC EditorHas Member: Poly1305, AbstractQuote, Has Member: Poly1305, Abstract
This document defines the ChaCha20 stream cipher as well as the use of the Poly1305 authenticator, both as stand-alone algorithms and as a "combined mode", or Authenticated Encryption with Associated Data (AEAD) algorithm.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.