Abstract
The binary cyclotomic periodic sequences, constructed by the cyclotomic cosets over finite fields, have good pseudo-random properties. In this paper, we determine the linear complexity of binary cyclotomic sequences of order 6. Our results show that such sequences have large linear complexity so that they can resist the linear attack method.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Berndt, B.C., Evans, R.J., Williams, K.S.: Gauss and Jacobi Sums. Wiley, New York (1998)
Cusick, T.W., Ding, C., Renvall, A.: Stream Ciphers and Number Theory. North Holland, Amsterdam (1998)
Ding, C.: On the linear complexity of Legendre sequences. IEEE Trans. Inf. Theor. 44(3), 1276–1278 (1998)
Ding, C.: Cyclic codes from cyclotomic sequences of order four. Finite Fields Appl. 23, 8–24 (2013)
Kim, J.H., Song, H.Y.: On the linear complexity of Hall’s sextic residue sequences. IEEE Trans. Inf. Theor. 45, 2094–2096 (2001)
Lidl, R., Niederreiter, H.: Finite Fields. Cambridge University Press, New York (1997)
Acknowledgments
This research is supported by a National Key Basic Research Project of China (2011CB302400), National Science Foundation of China (61379139) and the “Strategic Priority Research Program” of the Chinese Academy of Sciences, Grant No. XDA06010701.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Wang, Q. Linear complexity of binary cyclotomic sequences of order 6. J. Appl. Math. Comput. 49, 119–125 (2015). https://doi.org/10.1007/s12190-014-0827-9
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12190-014-0827-9