首页 | 本学科首页   官方微博 | 高级检索  
     检索      

进位返加与逐位模2加及模2n加的相容程度分析
引用本文:孙莹,金晨辉.进位返加与逐位模2加及模2n加的相容程度分析[J].高校应用数学学报(A辑),2005,20(3):371-376.
作者姓名:孙莹  金晨辉
作者单位:1. 海军计算技术研究所,北京,100841
2. 解放军信息工程大学,电子技术学院,河南郑州,450004
基金项目:河南省杰出青年科学基金(0312001800)
摘    要:深入分析了进位返加运算与逐位模2加运算及模2^n加运算的相容程度,给出了它们的相容概率的计算公式.结论表明,进位返加运算与逐位模2加运算的相容概率尽管很小,但远大于理想值2^-n;进位返加运算与模2^n加运算的相容概率很大,近似为2/3.

关 键 词:进位返加运算  逐位模2加运算  模2^n加运算  相容性  相容概率  密码学
文章编号:1000-4424(2005)03-0371-06
收稿时间:2004-11-10
修稿时间:2004-11-10

Consistent degree analysis of ones complement addition with bit-wise exclusive-OR and with addition module 2n
SUN Ying,JIN Chen-hui.Consistent degree analysis of ones complement addition with bit-wise exclusive-OR and with addition module 2n[J].Applied Mathematics A Journal of Chinese Universities,2005,20(3):371-376.
Authors:SUN Ying  JIN Chen-hui
Abstract:The consistent degree of ones complement addition with bit-wise exclusive-OR 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.
Keywords:ones consistency  consistent complement addition  bit-wise exclusive-OR  addition module 2^n probability  cryptology
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号