On GF(p)-linear complexities of binary sequences

被引：3

作者：

XU Liqing Software Engineering InstituteEast China Normal UniversityShanghai China ^{[200062
]}

机构：

来源：

The Journal of China Universities of Posts and Telecommunications | 2009年 / 16卷 / 04期

关键词：

cryptography; stream cipher; binary sequences; GF(2) linear complexity; GF(p)-linear complexity;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Several geometric sequences have very low linear complexities when considered as sequences over GF(p),such as the binary sequences of period q n-1 constructed by Chan and Games [1-2] (q is a prime power pm,p is an odd prime) with the maximal possible linear complexity q n-1 when considered as sequences over GF(2). This indicates that binary sequences with high GF(2) linear complexities LC2 and low GF(p)-linear complexities LCp are not secure for use in stream ciphers. In this article,several lower bounds on the GF(p)-linear complexities of binary sequences is proved and the results are applied to the GF(p)-linear complexities of Blum-Blum-Shub,self-shrinking,and de Bruijn sequences. A lower bound on the number of the binary sequences with LC2 > LCp is also presented.

引用

页码：112 / 115

页数：4