DocumentCode :
3317411
Title :
An Efficient One-key Carter-Wegman Message Authentication Code
Author :
Xu, Jin ; Wang, Dayin ; Lin, Dongdai ; Wu, Wenling
Author_Institution :
Beijing Electron. Sci. & Technol. Inst.
Volume :
2
fYear :
2006
fDate :
3-6 Nov. 2006
Firstpage :
1331
Lastpage :
1334
Abstract :
In this paper, we present an efficient one-key Carter-Wegman message authentication code, called one-key Galois message authentication code (OGMAC), and prove its security for arbitrary length message. Generally, Carter-Wegman MACs use a universal hash and a block cipher, and require two keys, one for the block cipher and the other for the universal hash. OGMAC, proposed here, uses only one key and gets a good performance through the use of the universal hash over a binary finite field
Keywords :
cryptography; message authentication; arbitrary length message; binary finite field; one-key Carter-Wegman message authentication code; one-key Galois message authentication code; universal hash; Cryptography; Data security; Forgery; Information security; Message authentication; National security; Tagging;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computational Intelligence and Security, 2006 International Conference on
Conference_Location :
Guangzhou
Print_ISBN :
1-4244-0605-6
Electronic_ISBN :
1-4244-0605-6
Type :
conf
DOI :
10.1109/ICCIAS.2006.295275
Filename :
4076181
Link To Document :
بازگشت