An Algorithm for the Spectral Immunity of Binary Sequence with Period 2^n  

作　　者：LIU Zhenhua 

机构地区：[1]Computer Science Department,China Women's University

出　　处：《Wuhan University Journal of Natural Sciences》2016年第2期121-125,共5页武汉大学学报（自然科学英文版）

基　　金：Supported by the National Natural Science Foundation of China(61300181,61272057,61202434,61170270,61100203,61121061)

摘　　要：To resist the fast algebraic attack and fast selective discrete Fourier transform attacks,spectral immunity of a sequence or a Boolean function was proposed.At the same time,an algorithm to compute the spectral immunity of the binary sequence with odd period N was presented,here N is a factor of 2^n-1,where n is an integer.The case is more complicated when the period is even.In this paper,we compute linear complexity of every orthogonal sequence of a given sequence using Chan-Games algorithm and k-error linear complexity algorithm.Then,an algorithm for spectral immunity of binary sequence with period N=2^n is obtained.Furthermore,the time complexity of this algorithm is proved to be O（n）.To resist the fast algebraic attack and fast selective discrete Fourier transform attacks,spectral immunity of a sequence or a Boolean function was proposed.At the same time,an algorithm to compute the spectral immunity of the binary sequence with odd period N was presented,here N is a factor of 2^n-1,where n is an integer.The case is more complicated when the period is even.In this paper,we compute linear complexity of every orthogonal sequence of a given sequence using Chan-Games algorithm and k-error linear complexity algorithm.Then,an algorithm for spectral immunity of binary sequence with period N=2^n is obtained.Furthermore,the time complexity of this algorithm is proved to be O（n）.

关 键 词：spectral immunity algebraic immunity SEQUENCE linear complexity Boolean function 

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