A class of authentication codes with secrecy
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)].
- scientific article; zbMATH DE number 2127882
- Коды аутентификации с секретностью (обзор)
- Publication:3495045
- scientific article; zbMATH DE number 4070794
- Authentication encryption based on authentication code with secrecy
- On the construction of authentication and secrecy codes
- Progress in Cryptology - INDOCRYPT 2004
- Authentication-secrecy code based on conics over finite fields
- The combinatorics of authentication and secrecy codes
- A construction for authentication/secrecy codes from certain combinatorial designs
- A construction for authentication/secrecy codes from certain combinatorial designs
- A lower bound on authentication after having observed a sequence of messages
- Algebraic function fields and codes
- Bounds and characterizations of authentication/secrecy schemes
- Codes Which Detect Deception
- Curves related to Coulter's maximal curves
- Highly nonlinear mappings
- scientific article; zbMATH DE number 5296403 (Why is no real title available?)
- Some Artin-Schreier type function fields over finite fields with prescribed genus and number of rational places
- Three constructions of authentication codes with perfect secrecy
- Three constructions of authentication/secrecy codes
- Invariants of trace forms in odd characteristic and authentication codes
- Three constructions of authentication codes from power function over finite fields with perfect secrecy.
- Коды аутентификации с секретностью (обзор)
- scientific article; zbMATH DE number 5283673 (Why is no real title available?)
- scientific article; zbMATH DE number 842002 (Why is no real title available?)
- Power trace functions over finite fields
- scientific article; zbMATH DE number 5027117 (Why is no real title available?)
This page was built for publication: A class of authentication codes with secrecy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2430699)