In the present paper several constructions of Cartesian authentication codes from unitary geometry over finite fields are presented and their size parameters are computed. Assuming that the encoding rules are chosen according to a uniform probability distribution, the probabilities Pt and Ps of a su
โฆ LIBER โฆ
Cartesian authentication codes from functions with optimal nonlinearity
โ Scribed by Samuel Chanson; Cunsheng Ding; Arto Salomaa
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 173 KB
- Volume
- 290
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
โฆ Synopsis
In this paper, we present several classes of authentication codes using functions with perfect nonlinearity and optimum nonlinearity. Some of the authentication codes are optimal. On the other hand, these authentication codes are easy to implement due to their simple algebraic structures.
๐ SIMILAR VOLUMES
Construction of Cartesian authentication
โ
Zhe-Xian Wan
๐
Article
๐
1992
๐
Springer
๐
English
โ 886 KB
Construction of 1-Resilient Boolean Func
โ
Sen-Shan Pan; Xiao-Tong Fu; Wei-Guo Zhang
๐
Article
๐
2011
๐
Springer
๐
English
โ 365 KB
Accuracy-optimal reconstruction of funct
โ
A. I. Berezovskii
๐
Article
๐
1996
๐
Springer US
๐
English
โ 346 KB
A genetic algorithm with real-value codi
โ
M. Bessaou; P. Siarry
๐
Article
๐
2001
๐
Springer-Verlag
๐
English
โ 428 KB
Optimal impulse control on an unbounded
โ
Stefano Baccarin; Simona Sanfelici
๐
Article
๐
2006
๐
Springer-Verlag
๐
English
โ 156 KB
Optimal Recovery of Periodic Functions f
โ
K.Yu. Osipenko
๐
Article
๐
1996
๐
Elsevier Science
๐
English
โ 233 KB