关于CARTESIAN认证码的构造

On The Construction of Cartesian Authentication Codes

本文用初等方法构造了几类使对手模仿和替换攻击成功的概率都达到最小，且编码规则数也达到最小的认证码；同时也构造了使对手模仿和替换攻击成功的概率都达到最小，且编码规则也达到最小，源状态数达到最多的最佳认证码．并给出一种在不增加编码规则数量的情况下，将Ｃａｒｔｅｓｉａｎ认证码改造成完备安全（Ｐｅｒｆｅｃｔｓｅｃｒｅｃｙ）认证码的方法．

Several classes of authentication codes with the lowest probabilities of successful impersonation and substitution attack and the smallest encoding rules are constructed,and also authentication code with the lowest probabilities of successfully impersonation and substitution attack and the smallest encoding rules and the largest source states is constructed by elementary methods.A new modified method of restructuring Cartesian authentication codes into perfect secret authentication code is given and the quantity of encoding rules of the modified scheme is the same as original scheme.