嚴格擇多邏輯函數(shù)的密碼學特征
CRYPTOLOGICAL CHARACTERIZATION OF THE STRICT MAJORITY LOGIC FUNCTIONS
-
摘要: 本文主要討論了當n=2m+1(m1)時,n階嚴格擇多邏輯函數(shù)的代數(shù)正規(guī)形式中,所有的階為k((n+1)/2kn-1)的非線性項都出現(xiàn),從而從密碼學角度來說,這種函數(shù)有好的密碼學特征。
-
關(guān)鍵詞:
- 密碼學; 嚴格擇多邏輯函數(shù); 譜
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. -
計量
- 文章訪問數(shù): 2255
- HTML全文瀏覽量: 137
- PDF下載量: 556
- 被引次數(shù): 0
下載:
