A class of authentication codes with secrecy (Q2430699): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s10623-010-9461-1 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2057519655 / rank | |||
Normal rank |
Revision as of 02:43, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A class of authentication codes with secrecy |
scientific article |
Statements
A class of authentication codes with secrecy (English)
0 references
8 April 2011
0 references
In the paper under review a class of authentication codes with secrecy is studied. The authors, extending some results of \textit{E. Çakçak} and \textit{E. Özbudak} [Finite Fields Appl. 14, No.~1, 209--220 (2008; Zbl 1128.14013)], compute the number of rational places of a certain class of algebraic function fields and use it for the computation of the maximum success probabilities of the impersonation and the substitution attacks on these codes and the level of secrecy. Furthermore, all of the parameters of these authentication codes are at least as good as those in [\textit{C. Ding, A. Salomaa, P. Solé} and \textit{X. Tian}, J. Pure Appl. Algebra 196, No. 2--3, 149--168 (2005; Zbl 1068.94021)].
0 references
authentication codes with secrecy
0 references
algebraic function fields
0 references
linearized polynomials
0 references