Linear Complexity Problem of Binary Jacobi Sequence  

作　　者：YAN Tongjiang SUN Yuhua 

机构地区：[1]College of Sciences,China University of Petroleum,Qingdao 266555,Shandong,China [2]State Key Laboratory of Integrated Service Networks,Xidian University,Xi'an 710071,Shaanxi,China

出　　处：《Wuhan University Journal of Natural Sciences》2012年第6期481-484,共4页武汉大学学报（自然科学英文版）

基　　金：Supported by the National Natural Science Foundation of China (61170319,61063041);the Natural Science Fund of Shandong Province (ZR2010FM017);the China Postdoctoral Science Foundation Funded Project(119103S148);the Fundamental Research Funds for the Central Universities(11CX04056A,10CX04038A)

摘　　要：This paper contributes to the stability of linear complexity of a binary periodic Jacobi sequence.By employing a pair of reference sequences,we prove that the linear complexity of a binary Jacobi sequence is unstable,namely,by changing its few bits in one-period length,the linear complexity of the modified sequences will become far less than the required value.This paper contributes to the stability of linear complexity of a binary periodic Jacobi sequence.By employing a pair of reference sequences,we prove that the linear complexity of a binary Jacobi sequence is unstable,namely,by changing its few bits in one-period length,the linear complexity of the modified sequences will become far less than the required value.

关 键 词：CRYPTOGRAPHY Jacobi sequence linear complexity stability of linear complexity 

分 类 号：TN918.4[电子电信—通信与信息系统]