关键词: 消息认证码, Carter-Wegman消息认证码, 泛Hash函数族, 伪随机函数

Abstract:

In order to study the construction of XOR message authentication code (XOR-MAC), we analyse it from the view of universal Hash and pseudo-random function, using shared random funciton model. Firstly, XOR-MAC is splited into two parts: a pseudo-random funtion and an universal Hash. Secondly, this two parts can be proved to have certain properties. Finally, XOR-MAC is regarded as a kind of Carter-Wegman MAC by adopting a new method that applies a pseudo-random functions directly to the output of an universal Hash family. And we give a simple security proof of XOR-MAC based on information theory. The most important thing is that many new MACs can be easily constructed using this idea.

Key words: message authentication code, Carter-Wegman message authentication code, universal Hash family, pseudo-random functions