Advertisement

A Fast Algorithm for Determining the Linear Complexity of Periodic Sequences

  • Shimin Wei
  • Guolong Chen
  • Guozhen Xiao
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3822)

Abstract

An efficient algorithm for determining the linear complexity and the minimal polynomial of sequence with period p m q n over a finite field GF(q) is designed, where p andq are primes, and q is a primitive root modulo p 2. The new algorithm generalizes the algorithm for computing the linear complexity of sequences with period q n over GF(q) and that for computing the linear complexity of sequences with period p m over GF(q).

Keywords

Efficient Algorithm Fast Algorithm Binary Sequence Linear Complexity Anhui Province 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Massey, J.L.: Shift register synthesis and BCH decoding. IEEE Trans. on Inform. Theory. 15(1), 122–127 (1969)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Games, R.A., Chan, A.H.: A fast algorithm for determining the complexity of a binary sequence with period 2n. IEEE Trans on Inform. Theory 29(1), 144–146 (1983)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Ding, C., Xiao, G., Shan, W.: The Stability Theory of Stream Ciphers. In: Ding, C., Shan, W., Xiao, G. (eds.) The Stability Theory of Stream Ciphers. LNCS, vol. 561, Springer, Heidelberg (1991)Google Scholar
  4. 4.
    Xiao, G., Wei, S., Lam, K.Y., Imamura, K.: A fast algorithm for determining the linear complexity of a sequence with period p n over GF(q). IEEE Trans. on Inform. Theory 46(6), 2203–2206 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Wei, S., Xiao, G., Chen, Z.: A fast algorithm for determining the linear complexity of a binary sequence with period 2n p m. Science in China(Series F) 44(6), 453–460 (2001)zbMATHMathSciNetGoogle Scholar
  6. 6.
    Wei, S., Xiao, G., Chen, Z.: a fast algorithm for determining the minimal polynomial of a sequence with period 2p n over GF(q). IEEE Trans. on Inform. Theory 48(10), 2754–2758 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    McEliece, R.J.: Finite Fields for Computer Scientists and Engineers. Kluwer Academic, Boston (1987)zbMATHGoogle Scholar
  8. 8.
    Rosen, K.H.: Elementary Number Theory and Its Applications. Addision-Wesley, Reading (1988)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Shimin Wei
    • 1
  • Guolong Chen
    • 1
  • Guozhen Xiao
    • 2
  1. 1.Department of Computer Science & TechniqueHuaibei Coal Normal CollegeHuaibeiChina
  2. 2.Institute of Information SecurityXidian UniversityXi’anChina

Personalised recommendations