← 研踪 PaperTrailarXiv:2605.14823 · v4
A class of asymptotically optimal authentication codes with secrecy
首次提交 2026-05-14 21:32
版本更新 2026-11-05 14:13
雷达观测 2026-11-06 12:09
摘要
In this paper, a class of linear authentication codes with secrecy, which are equipped with simple encoding rules, is constructed. By means of a special Weil sum, the maximum success probabilities of impersonation attack (denoted by $P_I$) and of substitution attack (denoted by $P_S$) for these codes are explicitly derived. It is further proven that the codes are asymptotically optimal, in the sense that both the information theoretic bound and the combinatorial bound for authentication codes are asymptotically attained by $P_I$ and $P_S$.
观测到的版本
相邻记录可能跳过中间版本；首次发现 v2 及以上也会标为版本更新。
v4 · 2026-11-05 14:13 · 最新观测版本
A class of asymptotically optimal authentication codes with secrecy
In this paper, a class of linear authentication codes with secrecy, which are equipped with simple encoding rules, is constructed. By means of a special Weil sum, the maximum success probabilities of impersonation attack (denoted by $P_I$) and of substitution attack (denoted by $P_S$) for these codes are explicitly derived. It is further proven that the codes are asymptotically optimal, in the sense that both the information theoretic bound and the combinatorial bound for authentication codes are asymptotically attained by $P_I$ and $P_S$.
查看此版本解读 →查看此版本原文 ↗