By Topic

An Efficient One-key Carter-Wegman Message Authentication Code

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Jin Xu ; Beijing Electron. Sci. & Technol. Inst. ; Wang, Dayin ; Dongdai Lin ; Wenling Wu

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

Published in:

Computational Intelligence and Security, 2006 International Conference on  (Volume:2 )

Date of Conference:

3-6 Nov. 2006