Abstract
We found the linear complexity of generalized cyclotomic sequences with period \(2p^n\) based on quadratic, biquadratic and partially sextic residues. Our method is based on the generating the polynomial of the classical cyclotomic sequences, which allows us to obtain some well-known results and also some new results.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Cusick, T.W., Ding, C., Renvall, A.: Stream Ciphers and Number Theory, 470 p. North-Holland Publishing Co., Amsterdam (1998)
Ding, C., Helleseth, T., Shan, W.: On the linear complexity of Legendre sequences. IEEE Trans. Inf. Theory 44, 1276–1278 (1998)
Ding, C., Helleseth, T.: New generalized cyclotomy and its applications. Finite Fields Appl. 4, 140–166 (1998)
Ding, C., Helleseth, T.: Generalized cyclotomic codes of length \(p_1^{e_1}..p_t^{e_t}\). IEEE Trans. Inf. Theory 45, 467–474 (1999)
Ding, C., Pless, V.: Cyclotomy and duadic codes of prime lengths. IEEE Trans. Inf. Theory 45, 453–466 (1999)
Ding, C., Helleseth, T., Martinsen, H.: New families of binary sequences with optimal three-level autocorrelation. IEEE Trans. Inf. Theory 47, 428–433 (2001)
Edemskii, V.A.: On the linear complexity of binary sequences on the basis of biquadratic and sextic residue classes. Discret. Math. Appl. 20(1), 75–84 (2010) (Diskretn. Mat. 22(1), 74–82 (2010))
Edemskiy, V.A.: About computation of the linear complexity of generalized cyclotomic sequences with period \(p^{n+1}\). Des. Codes Cryptogr. 61(3), 251–260 (2011)
Golomb, S.W., Gong, G.: Signal Design for Good Correlation for Wireless Communication. Cryptography and Radar, 438 p. Cambridge University Press, Cambridge (2005)
Hall, M.: Combinatorial Theory, 462 p. Wiley, New York (1975)
Ireland, K., Rosen, M.: A Classical Introduction to Modern Number Theory, p. 389 Springer, Berlin (1982)
Ke, P., Zhang, J., Zhang, S.: On the linear complexity and the autocorrelation of generalized cyclotomic binary sequences of length \(2p^m\). Des. Codes Cryptogr. 67(3), 325–339 (2013)
Kim, Y.-J., Song, H.-Y.: Linear complexity of prime n-square sequences. In: Proceedings IEEE International Sympopsium on Information Theory, vol. 2008, pp. 2405–2408 (2008)
Lidl, R., Neiderreiter, H.: Finite Fields. Encyclopedia of Mathematics and its Applications Reading, vol. 20. Addison-Wesley, MA (1983)
Menezes, A., Oorschot, P.V., Vanstone, S.: Handbook of Applied Cryptography, 816 p. CRC Press, Boca Raton (1997)
Tan, L., Xu, H., Qi, W.-F.: Remarks on the generalized cyclotomic sequences of length \(2p^{m}\). Appl. Algebra Eng. Commun. Comput. 23(5–6), 221–232 (2012)
Yan, T., Li, X.: Some notes on the generalized cyclotomic binary sequences of length 2\(p^m\) and \(p^m\). IEICE Trans. Fundam. E96-A 10, 2049–2051 (2013)
Yan, T., Li, S., Xiao, G.: On the linear complexity of generalized cyclotomic sequences with the period \(p^m\). Appl. Math. Lett. 21, 187–193 (2008)
Zhang, J., Zhao, C.-A., Ma, X.: On the linear complexity of generalized cyclotomic binary sequences with length \(2p^2\). IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E93 A 1, 302–308 (2010)
Zhang, J., Zhao, C.-A., Ma, X.: Linear complexity of generalized cyclotomic binary sequences of length \(2p^m\). Appl. Algebra Eng. Commun. Comput. 21(2), 93–108 (2010)
Acknowledgments
The authors acknowledge the patient referees for their valuable and constructive comments which helped to improve this work.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Edemskiy, V., Antonova, O. The linear complexity of generalized cyclotomic sequences with period \(2p^n\) . AAECC 25, 213–223 (2014). https://doi.org/10.1007/s00200-014-0223-6
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00200-014-0223-6