苏州科技学院学报（自然科学版）2016，Vol.33Issue(2)：55-63,9.
4错线性复杂度的2n周期序列计数
Counting functions for 2 n-periodic binary sequences with 4-error linear complexity
摘要
Abstract
The k-error linear complexity is one of the important measures for assessing the stability of sequence cipher. First, we presented the process of counting functions of 2n-periodic binary sequences with given 4-error linear complexity. Then we studied the critical error linear complexity via cube theory and sieve method. The possible values of the 4-error linear complexity of corresponding critical error point (descent point) were obtained and the number of sequences with given 4-error linear complexity of corresponding critical error point were es-tablished. Finally, we got the all the possible value forms of the 4-error linear complexity and the counting func-tions of 2n-periodic binary sequences.关键词
关键错误线性复杂度/k错线性复杂度/方体理论/筛选法Key words
critical error linear complexity/k-error linear complexity/cube theory/sieve method分类
信息技术与安全科学引用本文复制引用
毕松松,戴小平..4错线性复杂度的2n周期序列计数[J].苏州科技学院学报（自然科学版）,2016,33(2):55-63,9.基金项目
安徽省自然科学基金资助项目（1208085MF106）；安徽省教育厅自然科学基金资助项目（KY2013Z025）；安徽工业大学校青年科学基金资助项目 （）
