Linear Complexity of Least Significant Bit of Polynomial Quotients
Chun'e Zhao, Wenping Ma, Tongjiang Yan, Yuhua Sun · Chinese Journal of Electronics · 2017
Binary sequences with large linear complexity have been found many applications in communication systems. We determine the linear complexity of a family of p2-periodic binary sequences derived from poly-nomial quotients modulo an odd prime p. Results show that these sequences have high linear complexity, which means they can resist the linear attack method.