Logarithm Cartesian authentication codes

Authors:
T. W. Sze;S. Chanson;C. Ding;T. Helleseth;M. G. Parker
Affiliations:
Department of Computer Science, Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, China;Department of Computer Science, Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, China;Department of Computer Science, Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, China;Department of Informatics, University of Bergen, 5020 Bergen, Norway;Department of Informatics, University of Bergen, 5020 Bergen, Norway
Venue:
Information and Computation
Year:
2003

Citing 10
Cited 3

Authentication theory/coding theory

Proceedings of CRYPTO 84 on Advances in cryptology
Multi-receiver/multi-sender network security: efficient authenticated multicast/feedback

IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 3)
Combinatorial characterizations of authentication codes

Designs, Codes and Cryptography
Combinatorial Characterizations of Authentication Codes II

Designs, Codes and Cryptography
Universal Hashing and Geometric Codes

Designs, Codes and Cryptography
Multireceiver authentication code4: models, bounds, constructions, and extensions

Information and Computation
Characterisation of (k, n) Multi-receiver Authentication

ACISP '97 Proceedings of the Second Australasian Conference on Information Security and Privacy
Bounds and Constructions for Multireceiver Authentication Codes

ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Cartesian authentication codes from functions with optimal nonlinearity

Theoretical Computer Science
Constructions of authentication codes from algebraic curves over finite fields

IEEE Transactions on Information Theory

Highly nonlinear mappings

Journal of Complexity - Special issue on coding and cryptography
Constructions of External Difference Families and Disjoint Difference Families

Designs, Codes and Cryptography
Optimal frequency-hopping sequences with new parameters

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.06

Visualization

Abstract

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.