The Research and Analysis of the Excellent 2n Periodic Binary Sequence Based on Cat Swarm Optimization
Niu Zhi-hua① Ye Fei① Xin Ming-jun① Wang Chao②
①(School of Computer Engineering and Science, Shanghai University, Shanghai 200444, China) ②(School of Communication and Information Engineering, Shanghai University, Shanghai 200444, China)
Abstract：Strong sequences in cryptography should not only have a high linear complexity but the linear complexity should also be stable. Such sequences are called excellent sequence in this paper. Cat swarm optimization is an intelligent global optimization search algorithm. Based on given reasonable conditions, it can automatically generate excellent results hoped. By designing rational and effective fitness function, and appropriate parameters, cat swarm optimization is selected to find excellent sequence, and binary excellent sequence is got where the period N is 32, 64, 128, 256, 512, 1024 etc. and the error k is less than or equal to N/4. After combining a large number of experimental data, the conjecture is given that k-error linear complexity of excellent binary sequence with period N meets the law that LCk(S)≤N-2k+1.
牛志华, 叶飞, 辛明军, 王潮. 基于猫群优化算法的2n周期优秀二元序列的研究与分析[J]. 电子与信息学报, 2013, 35(6): 1365-1370.
Niu Zhi-Hua, Ye Fei, Xin Ming-Jun, Wang Chao. The Research and Analysis of the Excellent 2n Periodic Binary Sequence Based on Cat Swarm Optimization. , 2013, 35(6): 1365-1370.
2013, Vol. 35 
