A class of optimal authentication codes with secrecy
Information Theory
2026-05-15 v1 math.IT
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.
Keywords
Cite
@article{arxiv.2605.14823,
title = {A class of optimal authentication codes with secrecy},
author = {Haibo Liu and Chengzhi Wei and Qunying Liao},
journal= {arXiv preprint arXiv:2605.14823},
year = {2026}
}