On k-Error Linear Complexity of Some Explicit Nonlinear Pseudorandom Sequences

查看全文 作　　者：CHEN [1,2]Zhixiong;WU [1]Chenhuang 机构地区：[1]Key Laboratory of Applied Mathematics, Putian University,Putian 351100, Fujian, China;[2]Key Laboratory of Network Security and Cryptology, FujianNormal University, Fuzhou 350007, Fujian, China 出　　处：《Wuhan University Journal of Natural Sciences》索引2008年第13卷第5期,共5页 基　　金：the Natural Science Foundation of Fujian Province (2007F3086);the Funds of the Education Department of Fujian Prov-ince (JA07164);the Open Funds of Key Laboratory of Fujian Province University Network Security and Cryptology (07B005) 摘　　要：Combining with the research on the linear complexity of explicit nonlinear generators of pseudorandom sequences,we study the stability on linear complexity of two classes of explicit inversive generators and two classes of explicit nonlinear genera-tors. We present some lower bounds in theory on the k-error linear complexity of these explicit generators,which further improve the cryptographic properties of the corresponding number generators and provide very useful information when they are applied to cryptography. 关 键 词：流密码 外在非线性生成元 通讯技术 差错识别