Citation

Yap, Wun-She and Yeo, Sze Ling and Heng, Swee-Huay and Henricksen, Matt (2014) Parallelizable MAC revisited. Security and Communication Networks, 7 (7). pp. 1115-1127. ISSN 1939-0122

Full text not available from this repository.

Abstract

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.

Item Type:	Article
Subjects:	Q Science > QA Mathematics > QA71-90 Instruments and machines > QA75.5-76.95 Electronic computers. Computer science
Divisions:	Faculty of Information Science and Technology (FIST)
Depositing User:	Ms Nurul Iqtiani Ahmad
Date Deposited:	23 Jul 2014 07:17
Last Modified:	23 Jul 2014 07:17
URII:	http://shdl.mmu.edu.my/id/eprint/5641

Downloads

Edit (login required)