严格择多逻辑函数的密码学特征
CRYPTOLOGICAL CHARACTERIZATION OF THE STRICT MAJORITY LOGIC FUNCTIONS
-
摘要: 本文主要讨论了当n=2m+1(m1)时,n阶严格择多逻辑函数的代数正规形式中,所有的阶为k((n+1)/2kn-1)的非线性项都出现,从而从密码学角度来说,这种函数有好的密码学特征。
-
关键词:
- 密码学; 严格择多逻辑函数; 谱
Abstract: It is proved that in the algebraic normal form of the strict majority logic function with order n= 2m+1(m1), all the nonlinear terms of k-th order, (n+1)/2kn-1, must appear. Threrfore, from the view of cryptology, such strict majority logic function has good characteristics. -
T. Siegenthaler, IEEE Trans, on IT, IT-30(1984)5, 776-780.[2]C. Ding, D. Xiao, W. Shan, The Stability Theory of Stream Ciphers, Springer-Verlag Press, (1991), Germany, pp. 61-80.[3]Xiao Guo-Zhen, James. L. Massey, IEEE Trans. on IT, IT-34(1988)34. 431-433.[4]R. C. Titsworth, Optimal Ranging Codes, IEEE Trans. on Space Electronics and Telemetry, March 1964, 19-30. -
计量
- 文章访问数: 2208
- HTML全文浏览量: 124
- PDF下载量: 552
- 被引次数: 0
下载:
