An Efficient One-key Carter-Wegman Message Authentication Code

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