【摘要】 本文利用集合知识构造认证码,使其r(r>0)阶欺骗攻击成功的概率pr达到文献[2]的下界,即。更多还原

【Abstract】 In this paper,the authentication codes bosed on sets knowledge are constructed and which make the successful probability pr of of r-spoofing (r>0) attack achieve the information-theoretic low bound of reference[2],that is p4=2H(E|Mr+1)-J(E|Mr)更多还原