Abstract: This paper gives a new construction for (w, k, n) multi-receiver multi-fold authentication codes by using (n, w, q)-set and error-correcting codes. This construction makes probability of success in spoofing attack Pdu reach lower bound 1/q, and the maximum numbers of receivers and source states come to m(k, q) and m(w, q). Comparing m(k, q) and m(w, q) with q in the past, it shows that when k, w=2, the numbers improved is 1 or 2, when k, w≥q, the numbers improved is w-q+1. When q is a prime power, the lower bound improved is 1.

Key words: authentication code, error-correcting code, (n, w, q)-set

摘要： 基于(n, w, q)集和纠错码给出(w, k, n)多接收多重认证码的新构造。这种构造使得阶欺骗攻击的成功率Pdu达到了下界1/q，还使最大接收者人数和信源个数分别为m(k, q)和m(w, q)，与前人构造中的 对比发现，当k, w=2时，改进的数量为1或2，当k, w≥q时，改进的数量为w-q+1。此外当q为素数幂时，改进的下界为1。

关键词: 认证码, 纠错码, (n, w, q)集

CLC Number: 

• TP309