摘要
本文从实际出发减弱了Siegenthaler的“相关免疫”限制条件,实现了在不作出实质性“牺牲”的前提下避免了相关免疫性与线性复杂度之间的折衷(trade-off)。接着将Bent函数引入前馈网络的线性逼近熵漏现象的研究之中,得出了一些新结果。文中的研究方法也与前人不同。
From practical point of view, the Siegenthaler's definition of correlation im-munity 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 func-tions are used for the study of entropy immunity in feedforward netforks. New results and new methods are also presented.
基金
国家教委高校科研基金
国家青年自然科学基金资助课题
关键词
密码
前馈网络
相关免疫
抗熵漏
Cryptography
Feedforward networks
Correlation immunity
Entropy immunity
