We give a new definition of keyed hash functions and show its relation with strongly universal hash functions and Cartesian authentication codes. We propose an algorithm for a secure keyed hash function and present preliminary result on its performance. The algorithm can be used for fast (about twice the speed of MD5) and secure message authentication.
Support for this project was provided in part by the Ministry of Culture and Higher Education of Islamic Republic of Iran.
Support for this project was provided in part by the Australian Research Council under the reference number A49530480.