Linear Complezity of a New Generalized Cyclotomic Sequence of Order Four and Length pq

摘要：

Pseudorandom sequences with good randomness properties may be used widely in stream ciphers or communications. In this paper, we construct a new generalized cyclotomic sequence of order four and length pq, and determine the linear complexity of the sequence. The results show that the new sequence have quite good linear complexity.

作者: Shengqiang LI Liang ZHOU

作者单位: National Key Lab of Communication, University of Electronics Science and Technology of China, Chengdu, 610054, China

会议类型: 国际会议

会议名称: 2009国际通信电路与系统学术会议(ICCCAS 2009)(2009 International Conference on Communications，Circuits and Systems)

会议地点: 成都

会议语种:英文

页码: 331-334

在线出版日期: 2009-07-23（万方平台首次上网日期，不代表论文的发表时间）