On the linear complexity of a new generalized cyclotomic sequence with length ^mover GF(h)

Abstract

Based on the Ding-generalized cyclotomy,a new class of generalized cyclotomic sequences with length pm over the finite field of power of odd prime order was constructed,and the sequence was balanced.The linear complexity of the sequences was determined using the relationship between h and p and the theory of polynomial over finite field.It is shown that the sequence has good linear complexity,and it can resist attacks from the application of the Berlekamp-Massey algorithm.

Keywords

• stream cipher;pseudo-random sequence;generalized cyclotomy;linear complexity