计算机工程与应用
計算機工程與應用
계산궤공정여응용
COMPUTER ENGINEERING AND APPLICATIONS
2013年
18期
86-88
,共3页
cartesian认证码%k-生成树%r阶欺骗攻击%信息论下界
cartesian認證碼%k-生成樹%r階欺騙攻擊%信息論下界
cartesian인증마%k-생성수%r계기편공격%신식론하계
cartesian authentication code%k-spanning tree%r-spoofing attack%lower bound of information theory
利用完全图Kn中的k-生成树性质构造了一个新的cartesian认证码，计算了码参数，当编码规则按照均匀的概率分布被选取时，计算了该码的成功冒充攻击概率、成功替换攻击概率和r阶欺骗攻击成功的概率，改进了已有的相关结果。
利用完全圖Kn中的k-生成樹性質構造瞭一箇新的cartesian認證碼，計算瞭碼參數，噹編碼規則按照均勻的概率分佈被選取時，計算瞭該碼的成功冒充攻擊概率、成功替換攻擊概率和r階欺騙攻擊成功的概率，改進瞭已有的相關結果。
이용완전도Kn중적k-생성수성질구조료일개신적cartesian인증마，계산료마삼수，당편마규칙안조균균적개솔분포피선취시，계산료해마적성공모충공격개솔、성공체환공격개솔화r계기편공격성공적개솔，개진료이유적상관결과。
The cartesian authentication codes based on k-spanning tree are constructed and their parameters are derived. The probabilities of success for the impersonation attack, the substitution attack and r-spoofing attack are also computed respectively based on the assumption of the encoding rules which are chosen according to a uniform probability distribution. These results extend results given by Wang Yongchuan and Yang Yixian.
