Abstract:

From the splitting systematic authentication codes, a new kind of codes that is strongly splitting systematic authentication codes is constructed. By studying relation between this special codes and general systematic authentication codes, a low bound of maximum probabilities of a successful impersonation PS*I for all those codes is derived if encoding rule distributions are equiprobable. Moreover, we seek the low bound PS*I  of (c1,c2,…,ck) style strongly splitting systematic authentication codes ci(i=1,2,…,k), and turn a given (c1,c2,…,ck) style strongly splitting systematic authentication codes into the same style of codes having minimal PS*I. 

Key words: strongly splitting systematic authentication codes; local uniformization; mutual uniformization