UMAC: Fast and Provably Secure
Message Authentication (2000)
UMAC is a message authentication code : an algorithm for generating authentication tags, which are used to ensure the authenticity and integrity of transmitted messages. UMAC is the fastest message authentication code that has been reported on in the cryptographic literature. First described in 1999, UMAC has undergone significant revisions since its introduction in 1999. This page concerns the current version UMAC. The web page concerning the version of UMAC described in 1999 is at this link.
|ANSI C Source Code (pre-release)||UMAC Source Code|
|Timing and Throughput Data||UMAC Performance|
|Update on changes since CRYPTO '99||PostScript (177K) or PDF (100K)|
|CRYPTO '99 Paper: "UMAC: Fast and Secure Message Authentication". John Black, Shai Halevi, Hugo Krawczyk, Ted Krovetz, and Phillip Rogaway. Advances in Cryptology - CRYPTO '99. Lecture Notes in Computer Science, vol. 1666, Springer-Verlag, 1999, pp. 216-233.||PostScript (857K) or PDF (225K)|
Last updated 1 October 2004. For questions or comments, please contact Ted Krovetz <firstname.lastname@example.org>.