摘要
深入分析了进位返加运算与逐位模2加运算及模2n加运算的相容程度,给出了它们的相容概率的计算公式.结论表明,进位返加运算与逐位模2加运算的相容概率尽管很小,但远大于理想值2-n;进位返加运算与模2n加运算的相容概率很大,近似为2/3.
The consistent degree of ones complement addition with bit-wise exclusiveOR and with addition module 2^n is analyzed. The formulae for computing the consistency probabilities are given in this paper. It＇s revealed that the consistency probability of ones complement addition with bit-wise exclusive-OR is much greater than the ideal value 2^-n, though it is very small. And the consistency probability of ones complement addition with addition module 2^n is 2/3 approximately,hence it is very large.
出处
《高校应用数学学报（A辑）》
CSCD
北大核心
2005年第3期371-376,共6页
Applied Mathematics A Journal of Chinese Universities(Ser.A)
基金
河南省杰出青年科学基金(0312001800)
关键词
进位返加运算
逐位模2加运算
模2^n加运算
相容性
相容概率
密码学
ones consistency
consistent complement addition
bit-wise exclusive-OR
addition module 2^n probability
cryptology
