On the linear complexity of some new q-ary sequences
Some new q -ary sequences with period q3ek-1 q 3 ek - 1 (q=pm q = p m , p an odd prime, m, e, k  integers) are first constructed and then, inspired by Antweilers method, their linear complexity is examined. The exact value of linear complexity k(6e)w k ( 6 e ) w is determined when r = ? i = 1 w p e i . Furthermore, an upper bound of the linear complexity is given for the other values of r. Our results show that this sequence has larger linear span than GMW sequence with the same parameters. Finally, the results of a Maple program are included to illustrate the validity of the results.
linear complexity q-ary sequence stream cipher trace function