Linear complexity profile and correlation measure of interleaved sequences
Let m be a positive integer. We study the linear complexity profile and correlation measure of two interleaved m-ary sequences of length s and t, respectively. In the case that s ≥ 2t or s = t and m is prime we estimate the correlation measure in terms of the correlation measure of the first base sequence and the length of the second base sequence. In this case a relation by Brandstätter and Winterhof immediately implies a lower bound on the linear complexity profile of the interleaved sequence. If m is not a prime, under the same restrictions on s and t, the power correlation measure introduced by Chen and Winterhof takes the role of the correlation measure to obtain lower bounds on the linear complexity profile. Moreover, we show that these restrictions on s and t are necessary, and otherwise the (power) correlation measure can be close to st. However, introducing and estimating the (power) correlation measure with bounded lags we are able to get a lower bound on the linear complexity profile of the interleaved sequence.
|Keywords||correlation measures, Interleaved sequences, Legendre sequences, linear complexity profile|
|Journal||Cryptography and Communications|
He, J.J. (Jing Jane), Panario, D. (Daniel), Wang, Q, & Winterhof, A. (Arne). (2015). Linear complexity profile and correlation measure of interleaved sequences. Cryptography and Communications, 7(4), 497–508. doi:10.1007/s12095-015-0131-z