Logarithm Cartesian authentication codes. (Q1398375)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 1956116
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Logarithm Cartesian authentication codes. |
scientific article; zbMATH DE number 1956116 |
Statements
Logarithm Cartesian authentication codes. (English)
0 references
29 July 2003
0 references
The paper considers logarithm Cartesian authentication codes. It extends work by \textit{S. Chanson, C. Ding} and \textit{A. Salomaa} [Theor. Comput. Sci. 290, 1737--1752 (2003; Zbl 1044.68050)], who have provided several classes of authentication codes constructed from certain classes of functions. The paper at hand uses this framework to construct codes from logarithm functions. The codes obtained are better then a subclass of Helleseth-Johansson's codes and Bierbrauer's codes in terms of the success probability of the substitution attack.
0 references
authentication codes
0 references
cyclotomy
0 references
Cartesian codes
0 references
0 references
0.8451779
0 references
0.84117687
0 references
0.82842535
0 references
0.80472964
0 references
