PMAC is a MAC algorithm designed by Black and Rogaway [1] in 2002. A MAC algorithm is a cryptographic algorithm that computes a complex function of a data string and a secret key; the resulting MAC value is typically appended to the string to protect its authenticity. PMAC is a deterministic MAC algorithm based on a block cipher. In contrast to CBC-MAC, PMAC is fully parallelizable, which means that up to t processors can be used in parallel, where t is the number of n-bit blocks of the message. For serial computations, PMAC is about 8% slower than CBC-MAC\@. The computation of PMAC does not require the knowledge in advance of the message length.
In the following, the block length and key length of the block cipher will be denoted with n and k, respectively. The encryption with the block cipher E using the key K will be denoted with E K (·). An n-bit string consisting of zeroes will be denoted with 0n. The length of a string x in bits is denoted with |x|. If i ≥ 1 is an integer, \({\tt...
References
Black, J. and P. Rogaway (2000). “CBC-MACs for arbitrary length messages.” Advances in Cryptology—CRYPTO 2000, Lecture Notes in Computer Science, vol. 1880, ed. M. Bellare. Spring-Verlag, Berlin, 197–215.
Preneel, B. and P.C. van Oorschot (1995). “MDx-MAC and building fast MACs from hash functions.” Advances in Cryptology—CRYPTO'95, Lecture Notes in Computer Science, vol. 963, ed. D. Coppersmith. Spring-Verlag, Berlin, 1–14.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 International Federation for Information Processing
About this entry
Cite this entry
Preneel, B. (2005). PMAC. In: van Tilborg, H.C.A. (eds) Encyclopedia of Cryptography and Security. Springer, Boston, MA . https://doi.org/10.1007/0-387-23483-7_304
Download citation
DOI: https://doi.org/10.1007/0-387-23483-7_304
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-23473-1
Online ISBN: 978-0-387-23483-0
eBook Packages: Computer ScienceReference Module Computer Science and Engineering