强分裂系统码

Strongly Splitting Systematic Authentication Codes

从分裂认证码出发,构造一种新的强系统认证码.利用这种特殊的码与一般系统认证码的关系,得到这种码的最大模仿概率PIS*的下界公式;另外,进一步探讨ci(i=1,2,…,k)固定的(c1,c2,…,ck)型强分裂系统码的PSI*的下界公式,并且给出把已知的(c1,c2,…,ck)型强分裂系统码转变到PIS*最小的(c1,c2,…,ck)型强分裂系统码方法.

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 P1^S for all those codes is derived if encoding rule distributions are equiprobable. Moreover, we seek the low bound P1^S of （ c1,c2,…,ck） style strongly splitting systematic authentication codes ci（i=1,2,…,k）, and turn a given （c1,c2,…,ck） style strongly splitting systematic authentication codes into the same style of codes having minimal p1^S.