Abstract
Due to their nice algebraic structures and pseudorandom features, generalized cyclotomic sequences have wide applications in simulation, coding and cryptography. Based on the Ding–Helleseth sequence, Bai et al. proposed a class of balanced generalized sequences of length pq. Moreover, they showed that this class of sequences has high linear complexity over a finite field of order two. In this paper, we study the linear complexity and the minimal polynomial of this class of sequences over a general finite field. Results indicate the sequence considered possesses high linear complexity over a general finite field.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Aly H, Meidl M, Winterhof A (2007) On the k-error linear complexity of cyclotomic sequences. J Math Crypt 1:1–14
Bai E, Liu X, Xiao G (2005) Linear complexity of new generalized cyclotomic sequences of order two of length \(pq\). IEEE Trans Inf Theory 51(5):1849–1854
Cusick T, Ding C, Renvall A (1998) Stream ciphers and number theory. North-Holland Math Libr 55:198–212
Ding C (1997) Linear complexity of generalized cyclotomic binary sequences of order 2. Finite Fields Appl 3(2):159–174
Ding C (1998) Autocorrelation values of generalied cyclotomic sequences of order two. IEEE Trans Inf Theory 44(4):1699–1702
Ding C (2012) Cyclic codes from the two-prime sequences. IEEE Trans Inf Theory 58(6):3881–3890
Ding C (2013) Cyclic codes from cyclotomic sequences of order four. Finite Fields Appl 23:8–34
Ding C, Helleseth T (1998) New generalized cyclotomy and its applications. Finite Fields Appl 4:140–166
Ding C, Helleseth T, Shan W (1998) On the linear complexity of Legendre sequences. IEEE Trans Inf Theory 44(3):1276–1278
Golomb SW, Gong G (2005) Signal design for good correlation for wireless communication, cryptography and radar applications. Cambridge University Press, Cambridge
He D, Wang H, Wang L et al (2016) Efficient certificateless anonymous multi-receiver encryption scheme for mobile devices. Soft Comput. doi:10.1007/s00500-016-2231-x
Kim JH, Song HY (2001) On the linear complexity of Halls sextic residue sequences. IEEE Trans Inf Theory 45:2094–2096
Klapper A (1994) The vulnerability of geometric sequences based on fields of odd characteristic. J Cryptol 7(1):33–51
Liu JK, Au MH et al (2015) Secure sharing and searching for real-time video data in mobile cloud. IEEE Netw 29(2):46–50
Liu JK, Au MH et al (2016) Fine-grained two-factor access control for web-based cloud computing services. IEEE Trans Inf Forensics Secur 11(3):484–497
Liu JK, Liang KT et al (2016) Two-factor data security protection mechanism for cloud storage system. IEEE Trans Comput Comput 65(6):1992–2004
Pan ZQ, Zhang Y, Kwong S (2015) Efficient motion and disparity estimation optimization for low complexity multiview video coding. IEEE Trans Broadcast 61(2):166–176
Shen J, Shen J, Chen XF et al (2017) An efficient public auditing protocol with novel dynamic structure for cloud data. IEEE Trans Inf Forensics Secur. doi:10.1109/TIFS.2017.2705620
Wang Q, Lin D, Guang X (2014) On the linear complexity of Legendre sequences over \(F_q\). IEICE Trans Fundam E97–A(7):1627–1630
Wang Q, Jiang Y, Lin D (2015) Linear complexity of binary generalized cyclotomic sequences over \({\rm GF}(q)\). J Complex 31(5):731–740
Wang Q, Jiang Y, Lin D (2016) Linear complexity of Ding-Helleseth sequences of order 2 over \({\rm GF}(l)\). Cryptogr Commun 8(1):33–49
Whiteman AL (1962) A family of difference sets. Ill J Math 6:107–121
Wu W, Hu S, Yang X et al (2015) Towards secure and cost-effective fuzzy access control in mobile cloud computing. Soft Comput. doi:10.1007/s00500-015-1964-2
Acknowledgements
This study was funded by Natural Science Foundation of China (Grant Number 61772292, 61772476), Natural Science Foundation of Fujian Province (Grant Number 2015J01237), Fujian Normal University Innovative Research Team (Grant Number IRTL1207).
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
All the authors declare that they have no conflict of interest.
Ethical approval
This article does not contain any studies with human participants or animals performed by any of the authors.\(\mathbb {Z}\)
Additional information
Communicated by A. Di Nola.
Rights and permissions
About this article
Cite this article
Ye, Q., Ke, P. & Shen, J. Linear complexity of a class of pseudorandom sequences over a general finite field. Soft Comput 22, 4335–4346 (2018). https://doi.org/10.1007/s00500-017-2870-6
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-017-2870-6