Authentication Schemes from Highly Nonlinear Functions
Designs, Codes and Cryptography
Some constructions of systematic authentication codes using galois rings
Designs, Codes and Cryptography
Systematic authentication codes using additive polynomials
Designs, Codes and Cryptography
A Class of Nonbinary Codes and Sequence Families
SETA '08 Proceedings of the 5th international conference on Sequences and Their Applications
Optimal authentication codes from difference balanced functions
SETA'10 Proceedings of the 6th international conference on Sequences and their applications
The weight distribution of a class of p-ary cyclic codes
Finite Fields and Their Applications
On the relationships between perfect nonlinear functions and universal hash families
Theoretical Computer Science
| Hi-index | 754.84 |
Recently, highly nonlinear functions have been successfully employed to construct authentication codes with and without secrecy. In this paper, we construct four classes of systematic authentication codes from perfect nonlinear functions and almost-perfect nonlinear functions. The systematic authentication codes presented in this paper are either better than existing codes or as good as the best codes known.