New Construction for Multi-receiver Multi-fold Authentication Codes
Qin Cong · Jisuanji gongcheng · 2008
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.