API Build-data JSON Resources
Theme

Choose how MSRBot.io looks on this device.

Auto (match system) Light mode Dark mode

Preference is stored in this browser only.

IETF RFC 4418
[ACTIVE]

UMAC: Message Authentication Code using Universal Hashing

Metadata

Publisher
IETF
Doc Type
Informational
Pages
27
Abstract
This specification describes how to generate an authentication tag using the UMAC message authentication algorithm. UMAC is designed to be very fast to compute in software on contemporary uniprocessors. Measured speeds are as low as one cycle per byte. UMAC relies on addition of 32-bit and 64-bit numbers and multiplication of 32-bit numbers, operations well-supported by contemporary machines. To generate the authentication tag on a given message, a "universal" hash function is applied to the message and key to produce a short, fixed-length hash value, and this hash value is then xor'ed with a key-derived pseudorandom pad. UMAC enjoys a rigorous security analysis, and its only internal "cryptographic" component is a block cipher used to generate the pseudorandom pads and internal key material. This memo provides information for the Internet community.
Publication Date
2006-03-01
Status Note
Informational
DOI
10.17487/RFC4418
Link
https://doi.org/10.17487/RFC4418
Author(s)
Ted Krovetz
Latest version of IETF RFC 4418

Document Versions — IETF RFC 4418

  • ▶ IETF RFC 4418 (2006-03-01)
    THIS DOC [ACTIVE] [LATEST VERSION]

Normative Reference(s)

Bibliographic Reference(s)

  • D. Bernstein, "Stronger security bounds for permutations", unpublished manuscript, 2005. This work refines "Stronger security bounds for Wegman-Carter-Shoup authenticators", Advances in Cryptology - EUROCRYPT 2005, LNCS vol. 3494, pp. 164-180, Springer-Verlag, 2005. EXTERNAL
  • J. Black, S. Halevi, H. Krawczyk, T. Krovetz, and P. Rogaway, "UMAC: Fast and provably secure message authentication", Advances in Cryptology - CRYPTO '99, LNCS vol. 1666, pp. 216- 233, Springer-Verlag, 1999. EXTERNAL
  • T. Krovetz, "Software-optimized universal hashing and message authentication", UMI Dissertation Services, 2000. EXTERNAL
  • L. Carter and M. Wegman, "Universal classes of hash functions", Journal of Computer and System Sciences, 18 (1979), pp. 143- 154. EXTERNAL
  • M. Wegman and L. Carter, "New hash functions and their use in authentication and set equality", Journal of Computer and System Sciences, 22 (1981), pp. 265-279. EXTERNAL
  • IETF RFC 4303 [Active*]
Source Data (JSON)

Full registry record with provenance metadata. Open directly: /api/doc/RFC4418.json

Reference Tree

Explore all references and references to this document, as a navigable tree.

Open Reference Tree
Reference this Doc

Plain text (ISO 690 compliant)

Preview:
IETF RFC 4418, UMAC: Message Authentication Code using Universal Hashing. Available at https://doi.org/10.17487/RFC4418
Snippet:
IETF RFC 4418, UMAC: Message Authentication Code using Universal Hashing. Available at https://doi.org/10.17487/RFC4418

HTML (ISO 690 compliant)

Preview:
IETF RFC 4418, UMAC: Message Authentication Code using Universal Hashing. Available at https://doi.org/10.17487/RFC4418
Snippet:
<span class="citation"><cite>IETF RFC 4418</cite>, UMAC: Message Authentication Code using Universal Hashing. Available at <a href="https://doi.org/10.17487/RFC4418" target="_blank" rel="noopener">https://doi.org/10.17487/RFC4418</a></span>

SMPTE Icon SMPTE's HTML Pub

Preview:
IETF RFC 4418, UMAC: Message Authentication Code using Universal Hashing
doi: 10.17487/RFC4418
url: https://doi.org/10.17487/RFC4418
Snippet:
<li>
<cite id="bib-rfc4418">IETF RFC 4418</cite>, UMAC: Message Authentication Code using Universal Hashing
<span class="doi">10.17487/RFC4418</span>
</li>

Referenced By