The Linear Complexity of the Interleaved Polynomial Quotient Sequences

Chun-e Zhao ； Tongjiang Yan ； Xubo Zhao ； Qihua Niu

《International Journal of Network Security》 23卷3期 (2021/05) Pp. 455-460

https://doi.org/10.6633/IJNS.202105_23(3).10

摘要

Pseudorandom sequences have a wide range of applications in many fields, such as radar navigation systems, spread-spectrum communication systems, stream ciphers, etc. When used in stream ciphers, linear complexity is a significant index. This paper constructs a new class of interleaved sequences derived from binary polynomial quotient sequences, which have larger linear complexity, longer period, and better balance character than some known ones. The result shows that the linear complexity is large enough to resist BM-algorithm attacks.

關鍵字

Euler Quotient ； Fermat Quotient ； Interleaved Sequences ； Linear Complexity ； Polynomial Quotient