Linear complexity and autocorrelation values of a polyphase generalized cyclotomic sequence of length pq

被引：6
|
作者：
Chen, Zhixiong [1 ,2 ]
Du, Xiaoni [2 ,3 ]
机构：
[1] Putian Univ, Key Lab Appl Math, Putian 351100, Peoples R China
[2] Chinese Acad Sci, State Key Lab Informat Secur, Grad Univ, Beijing 100039, Peoples R China
[3] NW Normal Univ, Coll Math & Informat Sci, Lanzhou 730070, Peoples R China
来源：
FRONTIERS OF COMPUTER SCIENCE IN CHINA | 2010年 / 4卷 / 04期
关键词：
stream cipher; cyclotomic sequence; linear complexity; autocorrelation value; generalized cyclotomic classes; MODIFIED JACOBI SEQUENCES; ORDER; 2;
D O I：
10.1007/s11704-010-0329-3
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
A construction of a family of generalized polyphase cyclotomic sequences of length pq is presented in terms of the generalized cyclotomic classes modulo pq. Their linear complexity and corresponding minimal polynomials are deduced. Some upper bounds on periodic and aperiodic autocorrelation values of resulting sequences are also estimated by using certain exponential sums.
引用
收藏
页码：529 / 535
页数：7
相关论文
共 50 条
12345