Cube theory and k-error linear complexity profile
MetadataShow full item record
© 2016 SERSC. The linear complexity and k-error linear complexity of a sequence have been used as important measures for keystream strength. In order to study k-error linear complexity of binary sequences with period 2n, a new tool called cube theory is developed. In this paper, we first give a general decomposition approach to decompose a binary sequence with period 2n into some disjoint cubes. Second, a counting formula for m-cubes with the same linear complexity is derived, which is equivalent to the counting formula for k-error vectors. The counting formula of 2n-periodic binary sequences which can be decomposed into more than one cube is also investigated, which extends an important result by Etzion et al.. Finally, we study 2n-periodic binary sequences with the given k-error linear complexity profile. Consequently, the complete counting formula of 2n-periodic binary sequences with given k-error linear complexity profile of descent points 2, 4 and 6 is derived. The periodic sequences having the prescribed k-error linear complexity profile with descent points 1, 3, 5 and 7 are also briefly discussed.
Showing items related by title, author, creator and subject.
Zhou, J.; Liu, Wan-Quan; Wang, X. (2016)The linear complexity and k-error linear complexity of a sequencehave been used as important measures for keystream strength, hencedesigning a sequence with high linear complexity and k-errorlinear complexity is a popular ...
Zhou, Jianqin; Liu, Wan-quan (2013)The linear complexity and the k-error linear complexity of a sequence have been used as important security measures for key stream sequence strength in linear feedback shift register design. By using the sieve method of ...
Zhou, Jianqin (2017)This thesis proposes various novel approaches for studying the k-error linear complexity distribution of periodic binary sequences for k > 2, and the second descent point and beyond of k-error linear complexity critical ...