Abstract
Generalized cyclotomic sequences have good pseudo-random properties and have been widely used as keystreams in private-key cryptosystems. In this paper, the linear complexity and minimal polynomials of Ding-Helleseth sequences of order 2 have been determined over a finite field GF(l). Results show that these sequences have high linear complexity.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bai, E., Liu, X., Xiao, G.: Linear complexity of new generalized cyclotomic sequences of order two of length pq. IEEE Trans. Inf. Theory 51(5), 1849–1853 (2005)
Cusick, T.W., Ding, C., Renvall, A.: Stream Ciphers and Number Theory. North Holland, Amsterdam (1998)
Ding, C.: Linear complexity of generalized cyclotomic binary sequences of order 2. Finite Fields Appl. 3, 159–174 (1997)
Ding, C.: Autocorrelation values of generalized cyclotomic sequences of order two. IEEE Trans. Inf. Theory 44(4), 1699–1702 (1998)
Ding, C.: Cyclic codes from the two-prime sequences. IEEE Trans. Inf. Theory 58(6), 3881–3891 (2012)
Ding, C.: Cyclic codes from cyclotomic sequences of order four. Finite Fields Appl. 23, 8–24 (2013)
Ding, C., Zhou, Z.: Binary cyclic codes from explicit polynomial over GF(2m). Discret. Math. 321, 76–89 (2014)
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)
Ding, C., Helleseth, T.: On cyclotomic generator of order r. Inf. Process. Lett. 66, 21–25 (1998)
Ding, C., Helleseth, T.: New generalized cyclotomy and its application. Finite Fields Appl. 4, 140–166 (1998)
Ding, C., Helleseth, T., Shan, W.: On the linear complexity of Legendre sequences. IEEE Trans. Inf. Theory 44(3), 1276–1278 (1998)
Ding, C., Xiao, G., Shan, W.: The Stability Theory of Stream Ciphers. LNCS 561. Springer, Verlag (1991)
Klapper, A.: The vulnerability of geometric sequences based on fields of odd chareacter. J. Crypto. 7(1), 33–51 (1994)
Li, S., Chen, Z., Sun, R., Xiao, G.: On the randomness of generalized cylotomic sequences of order two and length pq. IEICE Trans. Fundam. E90(9), 2037–2041 (2007)
Lidl, R., Niederreiter, H.: Finite Fields. Cambridge University Press, New York (1997)
Storer, T.: Cyclotomy and Difference Sets. Markham, Chicago (1967)
Wang, Q., Jiang, Y., Lin, D.: Linear complexity of binary generalized cyclotomic sequences over GF(q). J. Complex. doi:10.1016/j.jco.2015.01.001 (2015)
Acknowledgments
This research is supported by a a National Key Basic Research Project of China (2011CB302400), National Science Foundation of China (61379139), the Strategic Priority Research Program of the Chinese Academy of Sciences (XDA06010701) and China Postdoctoral Science Foundation funded project under Grant 2014M560130.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Wang, Q., Jiang, Y. & Lin, D. Linear complexity of Ding-Helleseth sequences of order 2 over GF(l). Cryptogr. Commun. 8, 33–49 (2016). https://doi.org/10.1007/s12095-015-0138-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12095-015-0138-5