Logarithm Cartesian authentication codes.
The paper considers logarithm Cartesian authentication codes. It extends work by \textit{S. Chanson, C. Ding} and \textit{A. Salomaa} [Theor. Comput. Sci. 290, 1737--1752 (2003; Zbl 1044.68050)], who have provided several classes of authentication codes constructed from certain classes of functions. The paper at hand uses this framework to construct codes from logarithm functions. The codes obtained are better then a subclass of Helleseth-Johansson's codes and Bierbrauer's codes in terms of the success probability of the substitution attack.
scientific article; zbMATH DE number 1956116