抗熵漏前馈网络研究
ON ENTROPY IMMUNITY OF FEEDFORWARD NETWORKS
-
摘要: 本文从实际出发减弱了Siegenthaler的相关免疫限制条件,实现了在不作出实质性牺牲的前提下避免了相关免疫性与线性复杂度之间的折衷(trade-off)。接着将Bent函数引入前馈网络的线性逼近熵漏现象的研究之中,得出了一些新结果。文中的研究方法也与前人不同。
-
关键词:
- 密码; 前馈网络; 相关免疫; 抗熵漏
Abstract: From practical point of view, the Siegenthaler s definition of correlation immunity is improved. Under the new definition there exists no trade-off between the generalized correlation immunity and linear complexity of the output key streams. The famous Bent functions are used for the study of entropy immunity in feedforward netforks. New results and new methods are also presented. -
T. Siegenthaler, IEEE Int. Symp. Inform. Theory, Saint Jovite, Canada, 26-29, Sept. (1983).[2]T. Siegenthaler, IEEE Trans. on IT, IT-30(1954), 776-780.[3]T. Siegenthaler, IEEE Trans. on C, C-34(1985), 81-85.[4]R. Rueppel, Analysis and Design of Stream Ciphers, Springer-Verlag, New York, (1986).[5]曾肯成, 密码体制中的墒漏现象, 中科院研究生院数据处理中心报告,1988年.[6]Yang Yi Xian, IEE Electronics Letters, 23(1987), 1335-1336.[7]杨义先, 北京邮电学院学报, 1988年, 第3期, 第1-10页.[8]F. Macwilliams, N. Sloane, The Theory of Error-Correcting Codes, North-Holland, New York, (1977). -
计量
- 文章访问数: 1891
- HTML全文浏览量: 132
- PDF下载量: 457
- 被引次数: 0
下载:
