Abstract
This paper discusses pseudo-randomness of a periodic sequence, named the fourth class of GSS sequence. We get the following results: (1) Its least period always reaches the maximum (that is, 2n−1). (2) Its least period and linear complexity keep robust under single-symbol-substitution. (3) It has good low-degree-auto-correlation feature. (4) It has good short-length-run-distribution.
Similar content being viewed by others
References
Berlekamp, E. R., Algebraic Coding Theory, New York: McGraw-Hill, 1968.
Massey, J. L., Shift-register synthesis and BCH decoding, IEEE Transactions on Information Theory, Jan. 1969, 15(1): 122–127.
Ding, C., Xiao, G., Shan, W., The Stability Theory of Stream Ciphers, Berlin: Springer-Verlag, 1991.
Meier, W., Stafflebach, O., The self-shrinking generator, Advances in Cryptology—EUROCRYPT’94, Berlin: Springer-Verlag, 1995, 205–214.
Blackburn, S. R., The linear complexity of the self-shrinking generator, IEEE Trans. Inform. Theory, 1999, IT-45(6): 2073–2077.
Mihaljevic, M. J., A faster cryptanalysis of the self-shrinking generator, Information Security and Privacy-ACISP’96, LNCS1172, Berlin: Springer-Verlag, 1996, 181–189.
Zenner, E., Krause, M., Lucks, S., Improved cryptanalysis of the self-shrinking generator, Information Security and Privacy-ACISP’01, 2001, LNCS2119, Berlin: Springer-Verlag, 21–35.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Hu, Y., Xiao, G. Pseudo-randomness of the fourth class of GSS sequences. Sci China Ser F 47, 170–183 (2004). https://doi.org/10.1360/02yf0078
Received:
Issue Date:
DOI: https://doi.org/10.1360/02yf0078