[1] Driscoll Kevin. BeepBeep: embedded realtime encryption//Fast Software Encryption. Delhi: , 2002: 164-178. [2] 孙莹, 金晨辉. 进位返加与逐位模2加及模2<em>n加的相容程度分析[J]. 高校应用数学学报A辑, 2005, 20(3): 371-376. Sun Ying, Jin Chenhui. Consistent degree analysis of ones complement addition with bit-wise exclusive-OR and with addition module 2<em>n[J]. Applied Mathematics a Journal of Chinese Universities(A), 2005, 20(3): 371-376. [3] Ekdahl P, Johansson T. Distinguishing attacks on sober-t16 and t32//Daemen J, Rijmen V. Fast Software Encryption 2002. Berlin: Springer-Verlag, 2002: 210-224. [4] Maximov A. On linear approximation of Modulo sum//Fast Software Encryption 2004. Delhi: , 2004: 483-484. [5] 张龙, 吴文玲, 温巧燕. mod 2<em>n加运算与F2上异或运算差值的概率分布和递推公式[J]. 北京邮电大学学报, 2007, 30(1): 85-89. Zhang Long, Wu Wenling, Wen Qiaoyan. Probablity distribution and recursive formula of difference between mod 2<em>n sum and XOR over F2[J]. Journal of Beijing University of Posts and Telecommunications, 2007, 30(1): 85-89.