Skip to main content
SpringerLink
Log in

Some algorithms for the error linear complexity of binary 2n-periodic sequences

  • Published:
Wuhan University Journal of Natural Sciences

Abstract

Based on the Games-Chan algorithm and StampMartin algorithm, this paper provides some new algorithms to compute the error linear complexity spectrum of binary 2n-periodic sequences. These new algorithms are clearer and simpler than old algorithms, and they can quickly compute the error linear complexity spectrum of sequences according to different situations. We also discuss such algorithms and give some new results about linear complexity and error linear complexity of sequences.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ding C, Xiao G, Shan W. The Stability Theory of Stream Ciphers [M]. New York: Springer-Verlag, 1991.

    Google Scholar 

  2. Ruppel R. Analysis and Design of Stream Ciphers [M]. New York: Springer-Verlag, 1986.

    Google Scholar 

  3. Games R, Chan A. A fast algorithm for determining the complexity of a pseudorandom sequence with period 2n [J]. IEEE Transactions on Information Theory, 1983, 29: 144–146.

    Article  MathSciNet  MATH  Google Scholar 

  4. Stamp M, Martin C. An algorithm for the k-error linear complexity of binary sequences with period 2n [J]. IEEE Transactions on Information Theory, 1993, 39: 1398–1401.

    Article  MathSciNet  MATH  Google Scholar 

  5. Meidl W, Niederreiter H. Linear complexity, k-error linear complexity, and the discrete Fourier transform [J]. Journal of Complexity, 2002, 18: 87–103.

    Article  MathSciNet  MATH  Google Scholar 

  6. Etzion T, Kalouptsidis N, Kolokotronis N, et al. Properties of the error linear complexity spectrum [J]. IEEE Transactions on Information Theory, 2009, 55: 4681–4686.

    Article  MathSciNet  Google Scholar 

  7. Kurosawa K, Sato F, Kishimoto W. A relation between linear complexity and k-error linear complexity [J]. IEEE Transactions on Information Theory, 2000, 46: 694–698.

    Article  MathSciNet  MATH  Google Scholar 

  8. Chang Z, Wen Q. On the cryptographic properties of binary 2n-periodic sequences [J]. Chinese Journal of Electronics, 2011, 20: 307–311.

    Google Scholar 

  9. Lauder A, Paterson K. Computing the error linear complexity spectrum of a binary sequence of period 2n [J]. IEEE Transactions on Information Theory, 2003, 49: 273–280.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Zhengzhou University, Zhengzhou, 450001, Henan, China

    Zuling Chang & Li Duan

  2. School of Information Engineering, Zhengzhou University, Zhengzhou, 450001, Henan, China

    Xueyuan Wang

Authors
  1. Zuling Chang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xueyuan Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Li Duan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zuling Chang.

Additional information

Foundation item: Supported by the National Natural Science Foundation of China (61174085, 61170270, 61121061)

Biography: CHANG Zuling, male, Ph.D. candidate, Associate professor, research direction: sequences and communication.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chang, Z., Wang, X. & Duan, L. Some algorithms for the error linear complexity of binary 2n-periodic sequences. Wuhan Univ. J. Nat. Sci. 18, 42–48 (2013). https://doi.org/10.1007/s11859-013-0891-2

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11859-013-0891-2

Key words

CLC number

Search

Navigation