Systematic authentication codes using additive polynomials

Authors:
Ferruh Özbudak;Zülfükar Saygı
Affiliations:
Division of Mathematical Sciences, School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore, Republic of Singapore 637616 and Department of Mathematics and Institu ...;Department of Mathematics, Faculty of Arts and Sciences, TOBB Economics and Technology University, Ankara, Turkey 06530
Venue:
Designs, Codes and Cryptography
Year:
2008

Citing 7
Cited 0

Authentication theory/coding theory

Proceedings of CRYPTO 84 on Advances in cryptology
Finite fields

Finite fields
Cryptography: Theory and Practice

Cryptography: Theory and Practice
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 from highly nonlinear functions

IEEE Transactions on Information Theory
Curves related to Coulter's maximal curves

Finite Fields and Their Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Using additive polynomials related to some curves over finite fields, we construct two families of systematic authentication codes. We use tight bounds for the number of rational points of these curves in estimating the probabilities of the systematic authentication codes. We compare their parameters with some existing codes in the literature. We observe that the parameters are better than the existing ones in some cases.