Linear Complexity of Sextic Whiteman Generalized Cyclotomic Sequences
Tongjiang Yan · Jisuanji gongcheng · 2010
This paper considers the linear complexity of binary sextic Whiteman generalized cyclotomic sequences with period pq. Results show that the lower bound of their linear complexity is( p - 1)( q- 1) 2. From the viewpoint of stream cipher cryptosystems,almost all these sequences have good linear complexity. They can resist attacks from the application of the Berlekamp-Massey algorithm.