The linearcomplexity and the -errorlinearcomplexity of a sequence have been used as important security measures for key stream sequence strength in linear feedback shift register design. By using the sieve method o...
详细信息
The linearcomplexity and the -errorlinearcomplexity of a sequence have been used as important security measures for key stream sequence strength in linear feedback shift register design. By using the sieve method of combinatorics, we investigate the -errorlinearcomplexitydistribution of -periodic binary sequences in this paper based on Games-Chan algorithm. First, for , the complete counting functions for the -errorlinearcomplexity of -periodic binary sequences (with linearcomplexity less than ) are characterized. Second, for , the complete counting functions for the -errorlinearcomplexity of -periodic binary sequences with linearcomplexity are presented. Third, as a consequence of these results, the counting functions for the number of -periodic binary sequences with the -errorlinearcomplexity for and are obtained.
In this paper, a constructive approach for determining CELCS（critical errorlinearcomplexity spectrum） for the kerrorlinearcomplexitydistribution of 2~n-periodic binary sequences is developed via the sieve metho...
详细信息
ISBN:
(纸本)9781510830981
In this paper, a constructive approach for determining CELCS（critical errorlinearcomplexity spectrum） for the kerrorlinearcomplexitydistribution of 2~n-periodic binary sequences is developed via the sieve method and Games-Chan algorithm. Accordingly, the second descent point（critical point） distribution of the k-errorlinearcomplexity for 2~n-periodic binary sequences is characterized. As a by product, it is proved that the maximum k-errorlinearcomplexity is 2~n-(2) over all 2~n-periodic binary sequences, where 2<=k < 2 and l < n. With these results, some work by Niu et al. are proved to be incorrect.
暂无评论