Parallelizable MAC revisited. Issue 7 (10th July 2013)

• Record Type: Journal Article
• Authors: Yap, Wun‐She; Yeo, Sze Ling; Heng, Swee‐Huay; Henricksen, Matt
• Is Part Of: Security and communication networks. Volume 7:Issue 7(2014:Jul.)
• Page Start: 1115
• Page End: 1127
• Publication Date: 2013-07-10
• Subjects: Computer networks -- Security measures -- Periodicals; Computer security -- Periodicals; Cryptography -- Periodicals; 005.805
• DOI: 10.1002/sec.842
• Languages: English
• ISSNs: 1939-0114

Abstract

<abstract abstract-type="main" id="sec842-abs-0001"> <title>ABSTRACT</title> <p id="sec842-para-0001">Message authentication codes (MACs) are widely used in communication networks for authentication purposes. In EUROCRYPT 2002, Black and Rogaway proposed a parallelizable MAC (PMAC), which is relatively efficient when a parallel environment is possible. This parallelism is achieved via constant multiplications in the underlying finite field. In order to yield a better solution, Rogaway refined PMAC in ASIACRYPT 2004 by using a powering‐up construction to generate the constants. This is in contrast to the first design that uses successive words of the gray code to generate the constants. In this paper, we analyze how some unique characteristics of these constants result in weaknesses of the respective PMAC designs against forgery attacks in different ways. Thus, our analysis highlights some pitfalls that designers should be mindful of when designing schemes that exploit such constants. Copyright © 2013 John Wiley &amp; Sons, Ltd.</p> </abstract>