A class of optimal authentication codes with secrecy
classification
💻 cs.IT
math.IT
keywords
codesattackauthenticationclassoptimalsecrecyasymptoticallybounds
read the original abstract
In this paper, a class of linear authentication codes with secrecy are constructed, which have simple encoding rules and are easy to implement. Based on the special Weil sum, the maximum success probabilities of substitution attack and impersonation attack are calculated, and these codes are proven to be asymptotically optimal with respect to certain bounds.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.