Skip to main content
SpringerLink
Log in

Stability of the Linear Complexity of the Generalized Self-shrinking Sequences

  • Conference paper
Computational Intelligence and Security (CIS 2005)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3802))

Included in the following conference series:

  • 1217 Accesses

Abstract

The stability of the linear complexity of the generalized self-shrinking sequences over GF(2) with period N=2n− − 1 is investigated. The main results follow: The linear complexity of the periodic sequences obtained by either deleting or inserting one symbol within one period are discussed, and the explicit values for the linear complexity are given.

This work was supported in part by the Nature Science Foundation of China (No. 60273084) and Doctoral Foundation (No. 20020701013).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Key, E.L.: An analysis of the structure and complexity of nonlinear binary sequence generators. IEEE Trans. on Information Theory 22, 732–736 (1976)

    Article  MATH  Google Scholar 

  2. Rueppel, R.A.: Stream ciphers. In: Simmons, G.J. (ed.) Contemporary Cryptology: The Science of Information Integrity, New York, pp. 65–134. IEEE, Los Alamitos (1992)

    Google Scholar 

  3. Massey, J.: Shift-register synthesis and BCH decoding. IEEE Trans. on Information Theory 15, 122–127 (1969)

    Article  MATH  MathSciNet  Google Scholar 

  4. Dai, Z., Imamura, K.: Linear complexity for one-symbol substitution of a periodic sequence over GF(q). IEEE Trans. on Information Theory 44, 1328–1331 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  5. Uehara, S., Imamura, K.: Linear complexity of periodic sequences obtained from GF(q) sequences with period qn-1 by one-symbol insertion. IEICE Trans. Fundamentals E79-A, 1739–1740 (1996)

    Google Scholar 

  6. Uehara, S., Imamura, K.: Linear complexity of periodic sequences obtained from GF(q) sequences with period qn-1 by one-symbol deletion. IEICE Trans. Fundamentals E80-A, 1164–1166 (1997)

    Google Scholar 

  7. Ye, D., Dai, Z.: Linear complexity of periodic sequences under two symbol substitutions. In: Advances in Cryptology-China Crypto 1996, Beijing, China, pp. 7–9. Science Press (1996) (in chinese)

    Google Scholar 

  8. Uehara, S., Imamura, K.: Linear complexity of periodic sequences obtained from an m-sequence by two-symbol substitution. In: Proc. 1998 Int. Symp. Information Theory and It’s Applications (ISITA 1998), Mexico City, Mexico, October 1998, pp. 690–692 (1998)

    Google Scholar 

  9. Jiang, S., Dai, Z., Imamura, K.: Linear complexity of periodic sequences obtained from a Periodic Sequence by Either Substituting, Inserting, or Deleting k Symbols Within One Period. IEEE Trans Inform. Theory 46(3), 1174–1177 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  10. Hu, Y., Xiao, G.: Generalized Self-shrinking Generator. IEEE Transaction on Information Theory 50(4), 714–719 (2004)

    Article  MathSciNet  Google Scholar 

  11. Lidl, R., Niederreiter, H.: Finite fields. In: Encyclopedia of Mathematics and Its Applications, vol. 20. Addison-Wesley, Reading (1983)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The Key Lab. of Computer Networks and Information Security, The Ministry of Education, Xidian University, Xi’an, ShaanXi Province, 710071, P.R. China

    Lihua Dong, Yong Zeng & Yupu Hu

Authors
  1. Lihua Dong
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yong Zeng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yupu Hu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Microelectronic Instiute, Xidian University, 710071, Xi’an, China

    Yue Hao

  2. Department of Computer Science, Hong Kong Baptist University, Kowloon Tong, Hong Kong

    Jiming Liu

  3. School of Computer Science and Technology, Xidian University, Xi’an, China

    Yu-Ping Wang

  4. Department of Computer Science, Hong Kong Baptist University, Hong Kong,  

    Yiu-ming Cheung

  5. School of Electrical and Electronic Engineering, University of Manchester, UK

    Hujun Yin

  6. Life Science Research Center, School of Electronic Engineering, Xidian University, 710071, Xi’an, Shaanxi, China

    Licheng Jiao

  7. Key Laboratory of Computer Networks and Information Security(Ministry of Education), Xidian University, 710071, Xi’an, China

    Jianfeng Ma

  8. National Laboratory of Antennas and Microwave Technology, Xidian University, 710071, Xi’an, Shanxi, P.R. China

    Yong-Chang Jiao

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dong, L., Zeng, Y., Hu, Y. (2005). Stability of the Linear Complexity of the Generalized Self-shrinking Sequences. In: Hao, Y., et al. Computational Intelligence and Security. CIS 2005. Lecture Notes in Computer Science(), vol 3802. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11596981_10

Download citation

  • DOI: https://doi.org/10.1007/11596981_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30819-5

  • Online ISBN: 978-3-540-31598-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation