Optimal authentication codes from difference balanced functions

Authors:
Yang Yang;Xiaohu Tang;Udaya Parampalli
Affiliations:
Institute of Mobile Communications, Southwest Jiaotong University, Chengdu, Sichuan, PRC, China;Institute of Mobile Communications, Southwest Jiaotong University, Chengdu, Sichuan, PRC, China;Department of Computer Science and Software Engineering, University of Melbourne, Australia
Venue:
SETA'10 Proceedings of the 6th international conference on Sequences and their applications
Year:
2010

Citing 16
Cited 0

Authentication theory/coding theory

Proceedings of CRYPTO 84 on Advances in cryptology
On the relation between A-codes and codes correcting independent errors

EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Cryptography: Theory and Practice

Cryptography: Theory and Practice
Universal Hash Functions from Exponential Sums over Finite Fields and Galois Rings

CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Cartesian authentication codes from functions with optimal nonlinearity

Theoretical Computer Science
Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar

Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar
New Cyclic Difference Sets with Singer Parameters Constructed from d-Homogeneous Functions

Designs, Codes and Cryptography
A coding theory construction of new systematic authentication codes

Theoretical Computer Science - Insightful theory
A-Codes from Rational Functions over Galois Rings

Designs, Codes and Cryptography
On the cardinality of systematic authentication codes via error-correcting codes

IEEE Transactions on Information Theory
New nonbinary sequences with ideal two-level autocorrelation

IEEE Transactions on Information Theory
Linear authentication codes: bounds and constructions

IEEE Transactions on Information Theory
New family of p-ary sequences with optimal correlation property and large linear span

IEEE Transactions on Information Theory
Systematic authentication codes from highly nonlinear functions

IEEE Transactions on Information Theory
A Generic Construction of Cartesian Authentication Codes

IEEE Transactions on Information Theory
d-form sequences: families of sequences with low correlation values and large linear spans

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present two classes of optimal authentication codes without secrecy from difference balanced functions. The new codes are as good as or have more flexible parameters than the optimal codes from perfect nonlinear functions.