Authentication Schemes from Highly Nonlinear Functions

Authors:
Claude Carlet;Cunsheng Ding;Harald Niederreiter
Affiliations:
INRIA, Domaine de Voluceau, Le Chesnay Cedex, France F-78153;Department of Computer Science, The Hong Kong University of Science and Technology, Kowloon, China;Department of Mathematics, National University of Singapore, Singapore, Republic of Singapore 117543
Venue:
Designs, Codes and Cryptography
Year:
2006

Citing 6
Cited 3

Authentication theory/coding theory

Proceedings of CRYPTO 84 on Advances in cryptology
Codes, Bent Functions and Permutations Suitable For DES-likeCryptosystems

Designs, Codes and Cryptography
Weight Divisibility of Cyclic Codes, Highly Nonlinear Functions on F2m, and Crosscorrelation of Maximum-Length Sequences

SIAM Journal on Discrete Mathematics
Cryptography: Theory and Practice

Cryptography: Theory and Practice
Cartesian authentication codes from functions with optimal nonlinearity

Theoretical Computer Science
Systematic authentication codes from highly nonlinear functions

IEEE Transactions on Information Theory

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
On the relationships between perfect nonlinear functions and universal hash families

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We construct two families of authentication schemes using highly nonlinear functions on finite fields of characteristic 2. This leads to improvements on an earlier construction by Ding and Niederreiter if one chooses, for instance, an almost bent function as the highly nonlinear function.