Abstract
In this paper, we derive the linear complexity of Hall’s sextic residue sequences over the finite field of odd prime order. The order of the field is not equal to a period of the sequence. Our results show that Hall’s sextic residue sequences have high linear complexity over the finite field of odd order. Also we estimate the linear complexity of series of generalized sextic cyclotomic sequences. The linear complexity of these sequences is larger than half of the period.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aly, H., Meidl, W., Winterhof, A.: On the k-error linear complexity of cyclotomic sequences. J. Math. Cryptol. 1, 1–14 (2007)
Cusick, T.W., Ding, C., Renvall, A.: Stream Ciphers and Number Theory. North-Holland Publishing Co., Amsterdam (1998)
Dai, Z., Gong, G., Song, H.-Y., Ye, D.: Trace representation and linear complexity of binary eth power residue sequences of period p. IEEE Trans. Inf. Theory 57(3), 1530–1547 (2011)
Ding, C.: Linear complexity of generalized cyclotomic binary sequences of order 2. Finite Fields Appl. 3(2), 159–174 (1997)
Ding, C., Helleseth, T., Shan, W.: On the linear complexity of Legendre sequences. IEEE Trans. Inf. Theory 44(3), 1276–1278 (1998)
Du, X., Chen, Z.: A generalization of the Hall’s sextic residue sequences. Inf. Sci. 222, 784–794 (2013)
Edemskii, V.A.: On the linear complexity of binary sequences on the basis of biquadratic and sextic residue classes. Discrete Math. Appl. 20(1), 75–84 (2010), translation from Diskretn. Mat. 22(4), 74–82 (2010)
Edemskiy, V.: About computation of the linear complexity of generalized cyclotomic sequences with period \(p^{n+1}\). Des. Codes Cryptogr. 61, 251–260 (2011)
Fan, C., Ge, G.: A unified approach to Whiteman’s and Ding–Helleseth’s generalized cyclotomy over residue class rings. IEEE Trans. Inf. Theory 60, 1326–1336 (2014)
Golomb, S.W., Gong, G.: Signal Design for Good Correlation: For Wireless Communications, Cryptography and Radar Applications. Cambridge University Press, New York (2005)
Green, D.H., Smith, M.D., Martzoukos, N.: Linear complexity of polyphase power residue sequences. IEE Proc. Commun. 149(4), 195–201 (2002)
Hall, M.: Combinatorial Theory. Wiley, New York (1975)
Ireland, K., Rosen, M.: A Classical Introduction to Modern Number Theory. Springer, Berlin (1982)
Kim, J.H., Song, H.Y.: On the linear complexity of Hall’s sextic residue sequences. IEEE Trans. Inf. Theory 45, 2094–2096 (2001)
Wang, Q.: Linear complexity of binary cyclotomic sequences of order 6. J. Appl. Math. Comput. 49(1), 119–125 (2015)
Wang, Q., Lin, D., Guang, X.: On the linear complexity of Legendre sequences over \(F_q,\). IEICE Trans. Fundam. E97–A(7), 1627–1630 (2014)
Wang, Q., Jiang, Y., Lin, D.: Linear complexity of Ding–Helleseth sequences of order 2 over \(GF(l)\). Cryptogr. Commun. 8(1), 33–49 (2015)
Acknowledgments
The authors acknowledge the patient referees for their valuable and constructive comments which helped to improve this work. This work was supported by the Ministry of Education and Science of Russia as a part of state-sponsored Project No. 1.949.2014/K.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Edemskiy, V., Sokolovskiy, N. On the linear complexity of Hall’s sextic residue sequences over \({ GF}(q)\) . J. Appl. Math. Comput. 54, 297–305 (2017). https://doi.org/10.1007/s12190-016-1010-2
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12190-016-1010-2