Open AccessLinear Complexity of Least Significant Bit of Polynomial Quotients
Author(s) -
Zhao Chun'e,
Ma Wenping,
Yan Tongjiang,
Sun Yuhua
Publication year - 2017
Publication title -
chinese journal of electronics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.267
H-Index - 25
eISSN - 2075-5597
pISSN - 1022-4653
DOI - 10.1049/cje.2016.10.008
Subject(s) - quotient , bit (key) , polynomial , mathematics , computer science , discrete mathematics , arithmetic , combinatorics , computer network , mathematical analysis
Binary sequences with large linear complexity have been found many applications in communication systems. We determine the linear complexity of a family of p 2 ‐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.