DISTRIBUTION OF ONE-ERROR LINEAR COMPLEXITY OF BINARY SEQUENCES FOR ARBITRARY PRIME PERIOD  

作　　者：Lin TAN Wenfeng QI Hong XU 

机构地区：[1]Department of Applied Mathematics,Zhengzhou Information Science and Technology Institute

出　　处：《Journal of Systems Science & Complexity》2012年第6期1223-1233,共11页系统科学与复杂性学报（英文版）

基　　金：supported by the National Natural Science Foundation of China under Grant Nos.61070178, 61100200,and 60833008

摘　　要：Complexity measures for sequences, such as the linear complexity and the k-error linear complexity, play an important role in stream ciphers. This contribution studies the distribution of 1-error linear complexity of binary sequences with arbitrary prime period. For any odd prime N, the authors present all possible values of 1-error linear complexity of N-periodic binary sequences, and derive the exact formulas to count the number of N-periodic binary sequences with any given 1-error linear complexity.

关 键 词：k-error linear complexity linear complexity periodic sequences stream ciphers. 

分 类 号：TN918.1[电子电信—通信与信息系统] TN911.1[电子电信—信息与通信工程]