期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
On the Linear Complexity of New Generalized Cyclotomic Binary Sequences of Order Two and Period pqr 被引量:4
1
作者 Longfei Liu Xiaoyuan Yang +1 位作者 Xiaoni Du Bin Wei 《Tsinghua Science and Technology》 SCIE EI CAS CSCD 2016年第3期295-301,共7页
Periodic sequences over finite fields, constructed by classical cyclotomic classes and generalized cyclotomic classes, have good pseudorandom properties. The linear complexity of a period sequence plays a fundamental ... Periodic sequences over finite fields, constructed by classical cyclotomic classes and generalized cyclotomic classes, have good pseudorandom properties. The linear complexity of a period sequence plays a fundamental role in the randomness of sequences. Let p, q, and r be distinct odd primes with gcd(p-1, q-1 )=gcd(p- 1, r-1)=gcd(q-1, r-1)=2. In this paper, a new class of generalized cyclotomic sequence with respect to pqr over GF(2) is constructed by finding a special characteristic set. In addition, we determine its linear complexity using cyclotomic theory. Our results show that these sequences have high linear complexity, which means they can resist linear attacks. 展开更多
关键词 stream cipher pseudorandom sequence generalized cyclotomy linear complexity
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部