两个编码环节的相容性研究

Consistency of Two Code Links

2个运算的相容性反映了其中一种运算代替另一种运算所产生的误差大小,或者改变含这2种运算的混合等式中2个变量的位置或运算顺序所造成的误差大小.模2^n＋1加和模2^n-1加是密码算法设计中的2个编码环节,分析了模2^n＋1加和模2^n-1加之间在相等、分配律和结合律3种情况下的相容性.针对上述3种情况,分别给出了相等、在分配律情况下相等以及在结合律情况下相等的概率公式.最后,根据概率公式给出了这些相容性的特点,这对进一步认识和应用这2个编码环节有一定的实际意义.

Consistency of two operations means the error generated in substituting one with the other,or in changing the location and order of two variables in equations that contains both of them.Addition modulo 2^n＋1 and addition modulo 2^n-1 are two code links which are used in cryptography algorithms.This paper analyzed the consistency of addition modulo 2^n＋1 and addition modulo 2~n-1 under equality,distributive law and associative law.According to these three case,the probability formulas of equality,equality under distributive law and equality under associative law are presented.Finally,the consistency characters in different case are given with respect to probability formulas.