The cube theory for 2nperiodic binary sequences
Access Status
Date
2016Type
Metadata
Show full item recordAbstract
The linear complexity and kerror linear complexity of a sequencehave been used as important measures for keystream strength, hencedesigning a sequence with high linear complexity and kerrorlinear complexity is a popular research topic in cryptography. In order to study kerror linear complexity of binarysequences with period 2n, a new tool called cube theory isdeveloped. In this paper, we first give ageneral decomposition approach to decompose a binary sequence with period 2n into some disjoint cubes. Second, a countingformula for mcubes with the same linear complexity is derived, which is equivalent to the counting formula for kerror vectors. The counting formulaof 2nperiodic binary sequences which can be decomposedinto more than one cube is also investigated, which extends an important result by Etzion et al.
Citation
Source Title
ISBN
School
Collection
Related items
Showing items related by title, author, creator and subject.

Zhou, J.; Liu, WanQuan; Wang, X. (2016)© 2016 SERSC. The linear complexity and kerror linear complexity of a sequence have been used as important measures for keystream strength. In order to study kerror linear complexity of binary sequences with period 2n, ...

Zhou, J.; Liu, WanQuan; Wang, X. (2017)In this paper, in order to characterize the critical error linear complexity spectrum (CELCS) for 2 n periodic binary sequences, we first propose a decomposition based on the cube theory. Based on the proposed kerror ...

Zhou, Jianqin (2017)This thesis proposes various novel approaches for studying the kerror linear complexity distribution of periodic binary sequences for k > 2, and the second descent point and beyond of kerror linear complexity critical ...