费马商构造的二元序列的线性复杂度(英文)

被引：11

作者：

陈智雄 ^{[1
,2
]}

胡磊 ^{[2
]}

杜小妮 ^{[3
]}

机构：

[1] Department of Mathematics,Putian University

[2] State Key Laboratory of Information Security,Graduate School of Chinese Academy of Sciences

[3] College of Mathematics and Information Science,Northwest Normal

来源：

中国通信 | 2012年 / 9卷 / 02期

关键词：

cryptography; pseudorandom binary sequences; fermat quotients; finite fields; linear complexity;

D O I：

暂无

中图分类号：

TN918.1 [理论];

学科分类号：

070104 ;

摘要：

We determined the linear complexity of a family of p2-periodic binary threshold sequences and a family of p2-periodic binary sequences constructed using the Legendre symbol,both of which are derived from Fermat quotients modulo an odd prime p.If 2 is a primitive element modulo p2,the linear complexity equals to p2-p or p2-1,which is very close to the period and it is large enough for cryptographic purpose.

引用

页码：105 / 108

页数：4