AUTHORS: Vladimir Edemskiy, Chenhuang Wu
Download as PDF
The linear complexity of a sequence is an important parameter in its evaluation as a keystream cipher for cryptographic applications. Using of cyclotomic classes to construct sequences is an important method for designing sequences with high linear complexity. In this article, we study the linear complexity of generalized cyclotomic binary sequences of length 2 np m. These sequences were constructed from new generalized cyclotomic classed prepared by X. Zeng at el. We investigate discrete Fourier transform of these sequences and define the sufficient conditions for the existence of sequences with high linear complexity.
KEYWORDS: Binary sequences, linear complexity, cyclotomy, generalized cyclotomic sequence
REFERENCES:
[
1] T. Cusick, C. Ding, and A. Renvall, Stream ciphers and number theory. N.-Holl. Math. Libr.
vol.55, 1998.
[2] V. Edemskiy, O. Antonova, The linear complexity of generalized cyclotomic sequences
with period 2p
n
. AAECC, vol. 25, iss. 3, pp.
213–223, 2014.
[3] V. Edemskiy, O. Antonova, Linear complexity
of generalized cyclotomic sequences with period
2
mp
n
. Applied Discrete Mathematics, vol. 3, pp.
5–12, 2012 (in Russian).
[4] K. Ireland and M. Rosen, A Classical Introduction to Modern Number Theory. Springer, 1982.
[5] P. Ke, J. Zhang, and S. Zhang, On the linear
complexity and the autocorrelation of generalized cyclotomic binary sequences of length 2p
m.
Des. Codes Cryptogr., vol.67, no. 3, pp.325–
339, 2013
[6] R. Lidl, H. Niederreiter, Finite Fields. AddisonWesley, 1983.
[7] J. W. Zhang, C. A. Zhao, and X. Ma, Linear complexity of generalized cyclotomic binary
sequences of length 2p
m. AAECC., vol. 21, pp.
93–108, 2010.
[8] Z. Xiao, X Zeng, C. Li, and T. Helleseth, New generalized cyclotomic binary sequences of period p
2
. Des. Codes Cryptogr. DOI
10.1007/s10623-017-0408-7
[9] X. Zeng, H. Cai, X. Tang and Y. Yang, Optimal frequency hopping sequences of odd length.
IEEE Trans. Inf. Theory 59(5), 3237–3248
(2013).
[10] X. Du, Z. Chen, L. Hu., Linear complexity of binary sequences derived from Euler quotients with prime-power modulus. Inform. Process. Lett. 112 (2012) 604-609.
[11] V. Edemskiy, C. Li, X. Zeng and T. Helleseth, The linear complexity of generalized cyclotomic binary sequences of period p
n
. Designs, Codes and Cryptography, 2018, 1-15,
DOI: 10.1007/s10623-018-0513-2
[12] Z. Ye, P. Ke and C. Wu, A further study
of the linear complexity of new binary cyclotomic sequence of length p
n
. AAECC (2018).
https://doi.org/10.1007/s00200-018-0368-9
[13] Y. Ouyang and X. Xianhong, Linear complexity of generalized cyclotomic sequences
of period 2p
m. Des. Codes Cryptogr. (2019),
https://doi.org/10.1007/s10623-019-00638-5
[14] Z. Chen, V. Edemskiy, P. Ke and C. Wu,
On k-error linear complexity of pseudorandom
binary sequences derived from Euler quotients.
Advances in Mathematics of Communications.
Volume 12, No. 4, 2018, 805-816.
