%0 Journal Article
%T New Construction of Cryptographic Functions Satisfying PC(l) of Order k<br>满足k阶PC(l)的密码函数的新构造
%A Wei Yong-zhuang
%A Gao Jun-tao
%A Hu Yu-pu
%A <br>韦永壮
%A 高军涛
%A 胡子濮
%J 电子与信息学报
%D 2005
%I 
%X In this paper, a new generalized construction method for correlation immune Boolean function satisfying PC(l) of order k is provided. The construction is based on the use of linear error-correcting codes together with bijective functions. Furthermore, some new construction methods for (n , m , t) resilient functions satisfying PC(l) of order k is also discussed. In addition, the authors also show that these functions have many other good cryptographic properties such as high nonlinearity, good algebraic degree and so on.
%K Resilient functions
%K Propagation Characteristics(PC)
%K Linear code
%K Bijective functions<br>弹性函数
%K 扩散性
%K 线性码
%K 双射函数
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=1319827C0C74AAE8D654BEA21B7F54D3&jid=EFC0377B03BD8D0EF4BBB548AC5F739A&aid=B109B58CCC09791F&yid=2DD7160C83D0ACED&vid=DB817633AA4F79B9&iid=94C357A881DFC066&sid=C230D48775108CE3&eid=6C3EA4F7B6E5F836&journal_id=1009-5896&journal_name=电子与信息学报&referenced_num=0&reference_num=11