A class of optimal authentication codes with secrecy
arXiv:2605.1482351.5
AI Analysis
Provides theoretically optimal authentication codes for secure communication, but the result is incremental as it extends known constructions.
The paper constructs linear authentication codes with secrecy that are easy to implement, and proves they are asymptotically optimal against impersonation and substitution attacks using Weil sums.
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.