On the linear complexity of some new q-ary sequences

详细信息	查看全文 | 推荐本文 |

• 作者：Xiaoni Du ; Zhixiong Chen ; Guozhen Xiao
• 关键词：Stream cipher ; Linear complexity ; Trace function ; q-ary sequence
• 刊名：Information Sciences
• 出版年：2008
• 期刊代码：62_00200255
• 类别：cp
• 出版时间：15 August 2008
• 卷：178
• 期：16
• 页码：3300-3306
• 文件大小：137 K

摘要

Some new q-ary sequences with period q^3ek-1 (q=p^m, p an odd prime, m, e, k integers) are first constructed and then, inspired by Antweiler’s method, their linear complexity is examined. The exact value of linear complexity k(6e)^w is determined when . 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.