Long message authentication using pseudo-random functions

We give a method, using pseudo-random functions, to construct Cartesian authentication codes, that are close to the asymptotic Varshamov-Gilbert bound for Cartesian A-codes. The proposed method has a better asymptotic behaviour, than the until now best known constructions. The results are also used to analyze the multi-round authentication protocol.<
>