北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2007, Vol. 30 ›› Issue (1): 85-89.doi: 10.13190/jbupt.200701.85.zhangl

• 研究报告 • 上一篇    下一篇

mod2n加运算与F2上异或运算的差值的概率分布和递推公式

张 龙1, 2 , 吴文玲3 , 温巧燕1   

  1. 1. 北京邮电大学 理学院, 北京 100876;2. 黑龙江大学 数学科学学院, 黑龙江 哈尔滨 150080; 3. 中科院软件所 信息安全国家重点实验室, 北京 100080
  • 收稿日期:2006-01-04 修回日期:1900-01-01 出版日期:2007-03-30 发布日期:2007-03-30
  • 通讯作者: 张 龙

Probability Distribution and Recursive Formula of Difference between mod2n Sum and XOR over F2

ZHANG Long1, 2, WU Wen-ling3, WEN Qiao-yan1   

  1. 1. School of Science, Beijing University of Posts and Telecommunications, Beijing 100876, China;
    2. College of Mathematics Science, Heilongjiang University, Harbin 150080, China; 3. State Key Laboratory of Information Security, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China
  • Received:2006-01-04 Revised:1900-01-01 Online:2007-03-30 Published:2007-03-30
  • Contact: ZHANG Long

摘要:

提出了一种计算单mod2n加运算与F2上的异或运算的“异或差值”概率分布的有效算法,该算法的计算复杂度为O((n-1)/2) ,与Maximov的结果相比计算复杂度更低;对于多mod2n加运算的情形,给出了多mod2n加运算与F2上的异或运算的“异或差值”的递推计算公式.

关键词: 密码学, 流密码, mod2n加运算, 异或运算, 概率分布

Abstract:

An efficient algorithm to calculate the probability distribution of XOR difference between single mod2n sum and XOR is presented. The complexity of this algorithm is O((n-1)/2), which is lower than that of Maximov’s result. For the case of multi-mod2n sum, a recursive formula to calculate the XOR difference between multi-mod2n sum and XOR is given.

Key words: cryptology, stream cipher, mod2n sum, XOR, probability distribution

中图分类号: