Linear Complexity of New Binary Sequence Derived From Polynomial Quotients Modulo p in General Case and Their Generalizations

被引：0

作者：

Ma, Jiang ^{[1
]}

Zhang, Jun ^{[2
]}

Jia, Yanguo ^{[1
]}

Shen, Xiumin ^{[1
]}

机构：

[1] Yanshan Univ, Sch Informat Sci & Engn, Qinhuangdao 066004, Hebei, Peoples R China

[2] Tangshan Adm Market Regulat, Tangshan Inst Measurement Test, Tangshan 063000, Peoples R China

来源：

IEEE ACCESS | 2022年 / 10卷

基金：

中国国家自然科学基金;

关键词：

Pseudorandom sequences; electronic countermeasures; stream cipher; linear complexity; polynomial quotients; FERMAT QUOTIENTS;

D O I：

10.1109/ACCESS.2022.3201497

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Pseudorandom sequences with large linear complexity have been widely applied in electronic countermeasures, mobile communication and cryptography. Linear complexity is considered as a primary security criterion to measure the unpredictability of pseudorandom sequences. This paper presents the linear complexity and minimal polynomial of a new family of binary sequences derived from polynomial quotients modulo an odd prime p in general case. The results indicate that the sequences have high linear complexity, which means they can resist the linear attack against pseudo-noise or stream ciphers. Moreover, we generalize the result to the polynomial quotients modulo a power of p in general case. Finally, we design a Gpqs stream cipher generator based on the generalized binary pseudorandom sequences to implement the sequences in hardware.

引用

页码：98855 / 98859

页数：5