A class of authentication codes with secrecy (Q2430699)

In the paper under review a class of authentication codes with secrecy is studied. The authors, extending some results of \textit{E. Çakçak} and \textit{E. Özbudak} [Finite Fields Appl. 14, No.~1, 209--220 (2008; Zbl 1128.14013)], compute the number of rational places of a certain class of algebraic function fields and use it for the computation of the maximum success probabilities of the impersonation and the substitution attacks on these codes and the level of secrecy. Furthermore, all of the parameters of these authentication codes are at least as good as those in [\textit{C. Ding, A. Salomaa, P. Solé} and \textit{X. Tian}, J. Pure Appl. Algebra 196, No. 2--3, 149--168 (2005; Zbl 1068.94021)].