On the linear complexity of a new generalized cyclotomic sequence with length mover GF(h) |
| |
| Authors: | Long-fei LIU Kai YANG Xiao-yuan YANG |
| |
| Affiliation: | 1. Key Laboratory of Network ＆Information Security of Armed Police Force,Engineering University of Armed Police Force,Xi’an 710086,China;2. Key Laboratory of Computer Network ＆Information Security of the Ministry of Education,Xidian University,Xi’an 710071,China |
| |
| 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 |
|
| 点击此处可从《通信学报》浏览原始摘要信息 |
|
点击此处可从《通信学报》下载全文 |
|
