Logarithm cartesian authentication codes

Chanson, Ding, and Salomaa have recently constructed several classes of authentication codes using certain classes of functions. In this paper, we further extend that work by constructing two classes of Cartesian authentication codes using the logarithm functions. The codes constructed here involve the theory of cyclotomy and are better than a subclass of Helleseth–Johansson’s codes and Bierbrauer’s codes in terms of the maximum success probability with respect to the substitution attack.

Authors

• T.W. Sze
• S. Chanson
• C. Ding
• T. Helleseth
• M.G. Parker

Keywords

• Authentication codes
• Cryptography
• Cyclotomy