全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

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

DOI: 10.13190/jbupt.200701.85.zhangl, PP. 85-89

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

Full-Text   Cite this paper   Add to My Lib

Abstract:

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

References

[1]  Hawkes P, Rose G. Primitive specification and supporting documentation for sober-t16 sub mission to nessie[EB/OL].2000(2000-09-16)[2006-01-04].
[2]  Ekdahl P, Johansson T. Snow—a new stream cipher[EB/OL].2000(2000-11-22)[2006-01-04].
[3]  Rose G, Hawkes P. Turing: a fast stream cipher [C]// Johansson T. Fast Software Encryption 2003. Berlin: Springer-Verlag, 2003:290-306.
[4]  Rueppel R.Analysis and design of stream ciphers [M]. Berlin: Springer-Verlag, 1986:182-187.
[5]  Ekdahl P, Johansson T. Distinguishing attacks on sober-t16 and t32[C]// Daemen J, Rijmen V. Fast Software Encryption2002.Berlin:Springer-Verlag, 2002:210-224.
[6]  Watanabe D, Biryukov A, Canniere C.A disting- uishing attack of snow2.0 with linear masking method[C]// Matsui M, Zuccherato R. Selected Areas in Cryptography 2003. Berlin: Springer- Verlag, 2004:222-233.
[7]  Wallen J. Linear approximations of addition modulo 2n [C]// Johansson T. Fast Software Encryption 2003.Berlin: Springer-Verlag, 2003: 261-273.
[8]  Maximov A. On linear approximation of modulo sum[C]//Roy B, Meier W. Fast Software Encryp- tion 2004.Berlin:Springer-Verlag,2004:483-484.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133