Abstract
Klapper (1994) showed that there exists a class of geometric sequences with the maximal possible linear complexity when considered as sequences over GF(2), but these sequences have very low linear complexities when considered as sequences over GF(p) (p is an odd prime). This linear complexity of a binary sequence when considered as a sequence over GF(p) is called GF(p) complexity. This indicates that the binary sequences with high GF(2) linear complexities are inadequate for security in the practical application, while, their GF(p) linear complexities are also equally important, even when the only concern is with attacks using the Berlekamp-Massey algorithm [Massey, J. L., Shift-register synthesis and bch decoding, IEEE Transactions on Information Theory, 15(1), 1969, 122–127]. From this perspective, in this paper the authors study the GF(p) linear complexity of Hall’s sextic residue sequences and some known cyclotomic-set-based sequences.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Massey, J. L., Shift-register synthesis and bch decoding, IEEE Transactions on Information Theory, 15(1), 1969, 122–127.
Klapper, A., The vulnerability of geometric sequences based on fields of odd characteristic, Journal of Cryptology, 7(1), 1994, 33–51.
Chen, H. and Xu, L., On the binary sequences with high gf(2) linear complexities and low gf(p) linear complexities, IACR Cryptology ePrint Archive, 2005, 2005, 241.
XU, L. Q., On gf(p)-linear complexities of binary sequences, The Journal of China Universities of Posts and Telecommunications, 16(4), 2009. 112–124.
He, X., On the gf(p) linear complexity of Legendre sequences, Journal on Communications, 29(3), 2008, 16–22 (in Chinese).
Kim, J. H. and Song, H. Y., On the linear complexity of halls sextic residue sequences, IEEE Transactions on Information Theory, 47(5), 2001, 2094–2096.
Kim, J. H., Song, H. Y. and Gong, G., Trace representation of Hall’s sextic residue sequences of period p = 7 (mod 8), Mathematical Properties of Sequences and Other Combinatorial Structures, Springer-Verlag, New York, 2003, 23–32.
Dai, Z., Gong, G., Song, H. Y. and Ye, D., Trace representation and linear complexity of binary e-th power residue sequences of period, IEEE Transactions on Information Theory, 57(3), 2011, 1530–1547.
Dai, Z., Gong, G. and Song, H. Y., Trace representation and linear complexity of binary e-th residue sequences, Proceedings of International Workshop on Coding and Cryptography, 2003, 24–28.
Baumert, L. D., Cyclic Difference Sets, Springer-Verlag, New York, 1971.
Lazarus, A. J., The sextic period polynomial, Bulletin of the Australian Mathematical Society, 49(2), 1994, 293–304.
Colbourn, C. J. and Dinitz, J. H., Handbook of Combinatorial Designs, CRC Press, Boca Raton, 2010.
Ireland, K. and Rosen, M. I., A Classical Introduction to Modern Number Theory, Springer-Verlag, Boca Raton, 1982.
Ding, C., Helleseth, T. and Lam, K. Y., Several classes of binary sequences with three-level autocorrelation, IEEE Transactions on Information Theory, 45(7), 1999, 2606–2612.
Hu, L., Yue, Q. and Wang, M., The linear complexity of whitemans generalized cyclotomic sequences of period, IEEE Transactions on Information Theory, 58(8), 2012, 5534–5543.
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported by the National Natural Science Foundation of China (Nos. 61202007, U1509213), Top Priority of the Discipline (Information and Communication Engineering) Open Foundation of Zhejiang, the Postdoctoral Science Foundation (No. 2013M540323) and the Outstanding Doctoral Dissertation in Nanjing University of Aeronautics and Astronautics (No.BCXJ 13-17).
Rights and permissions
About this article
Cite this article
He, X., Hu, L. & Li, D. On the GF(p) linear complexity of Hall’s sextic sequences and some cyclotomic-set-based sequences. Chin. Ann. Math. Ser. B 37, 515–522 (2016). https://doi.org/10.1007/s11401-016-1023-z
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11401-016-1023-z