Abstract
Complexity measures for sequences, such as the linear complexity and the k-error linear complexity, play an important role in stream ciphers. This contribution studies the distribution of 1-error linear complexity of binary sequences with arbitrary prime period. For any odd prime N, the authors present all possible values of 1-error linear complexity of N-periodic binary sequences, and derive the exact formulas to count the number of N-periodic binary sequences with any given 1-error linear complexity.
Similar content being viewed by others
References
R. A. Rueppel, Analysis and Design of Stream Ciphers, Springer, Berlin, 1986.
J. L. Massey, Shift register synthesis and BCH decoding, IEEE Trans. Inform. Theory, 1969, 15(1): 122–127.
M. Stamp and C. F. Martin, An algorithm for the k-error linear complexity of binary sequences with period 2n, IEEE Trans. Inform. Theory, 1993, 39(4): 1398–1401.
C. Ding, G. Xiao, and W. Shan, The Stability Theory of Stream Cipher, Springer, Berlin, LNCS 561, 1991.
W. Meidl and H. Niederreiter, On the expected value of linear complexity and the k-error linear complexity of periodic sequences, IEEE Trans. Inform. Theory, 2002, 48(11): 2817–2825.
W. Meidl, On the stablity of 2n-periodic binary sequences, IEEE Trans. Inform. Theory, 2005, 51(3): 1151–1155.
W. Meidl and A. Vebkateswarlu, Remarks on the k-error linear complexity of p n-periodic sequences, Des. Codes Cryptogr., 2007, 42(2): 181–193.
F. X. Zhu and W. F. Qi, The 2-error linear complexity of 2n-periodic binary sequences, Chinese of Journal Electronics, 2008, 17(2): 256–260.
R. A. Games and A. H. Chan, A fast algorithm for determining the complexity of a binary sequence with period 2n, IEEE Trans. Inform. Theory, 1983, 29(1): 144–146.
G. Z. Xiao, S. M. Wei, K. Y. Lam, and K. Imamura, A fast algorithm for determining the linear complexity of a sequence with period p n over GF(q), IEEE Trans. Inform. Theory, 2000, 46(6): 2203–2206.
Y. K. Han, J. Chung, and K. Yang, On the k-error linear complexity of p n-periodic binary sequences, IEEE Trans. Inform. Theory, 2007, 53(6): 2297–2304.
W. Meidl and H. Niederreiter, Linear complexity, k-error linear complexity, and the discrete Fourier transform, J. Complexity, 2002, 18: 87–103.
R. Lidl and H. Niedereiter, Finite Fields, Reading, MA: Addison-Wesley, 1983.
T. Etzion, N. Kalouptsidis, N. Kolokotronis, K. Limniotis, and K. Paterson, Properties of the error linear complexity spectrum, IEEE Trans. Inform. Theory, 2009, 55(10): 4681–4686.
H. Niederreiter and I. E. Shparlinski, Periodic sequences with maximal linear complexity and almost maximal k-error linear complexity, Cryptography and Coding, Springer, Berlin, 2003, LNCS 2898: 183–189.
H. Niederreiter, Periodic sequences with large k-error linear complexity, IEEE Trans. Inform. Theory, 2003, 49(2): 501–505.
H. G. Hu, G. Gong, and D. G. Feng, New results on Periodic sequences with large k-error linear complexity, IEEE Trans. Inform. Theory, 2009, 55(10): 4687–4694.
F. W. Fu, H. Niederreiter, and M. Su, The characterization of 2n-periodic binary sequences with fixed 1-error linear complexity, Sequences and Their Applications 2006, Springer, Berlin, 2006, LNCS 4086: 88–103.
R. Kavuluru, 2n-Periodic binary sequences with fixed k-error linear complexity for k = 2 or 3, Sequences and Their Applications 2008, Springer, Berlin, 2008, LNCS 5203: 252–265.
Author information
Authors and Affiliations
Corresponding author
Additional information
This research was supported by the National Natural Science Foundation of China under Grant Nos. 61070178, 61100200, and 60833008.
This paper was recommended for publication by Editor Lei HU.
Rights and permissions
About this article
Cite this article
Tan, L., Qi, W. & Xu, H. Distribution of one-error linear complexity of binary sequences for arbitrary prime period. J Syst Sci Complex 25, 1223–1233 (2012). https://doi.org/10.1007/s11424-012-1101-6
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11424-012-1101-6