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

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

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...

Full description

Bibliographic Details
Main Authors: Jiang Ma, Jun Zhang, Yanguo Jia, Xiumin Shen
Format: Article
Language:English
Published: IEEE 2022-01-01
Series:IEEE Access
Subjects:
Pseudorandom sequences
electronic countermeasures
stream cipher
linear complexity
polynomial quotients
Online Access:https://ieeexplore.ieee.org/document/9866754/

Internet

https://ieeexplore.ieee.org/document/9866754/

Similar Items