Skip to main content
SpringerLink
Log in
Book cover

International Conference on Information Security and Cryptology

CISC 2005: Information Security and Cryptology pp 202–209Cite as

A Fast Algorithm for Determining the Linear Complexity of Periodic Sequences

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNSC,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).

This is a preview of subscription content, 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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Massey, J.L.: Shift register synthesis and BCH decoding. IEEE Trans. on Inform. Theory. 15(1), 122–127 (1969)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    Article  MATH  MathSciNet  Google Scholar 

  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. 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)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    MATH  MathSciNet  Google Scholar 

  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)

    Article  MATH  MathSciNet  Google Scholar 

  7. McEliece, R.J.: Finite Fields for Computer Scientists and Engineers. Kluwer Academic, Boston (1987)

    MATH  Google Scholar 

  8. Rosen, K.H.: Elementary Number Theory and Its Applications. Addision-Wesley, Reading (1988)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science & Technique, Huaibei Coal Normal College, Dongshan Road 100, Huaibei, 235000, Anhui, China

    Shimin Wei & Guolong Chen

  2. Institute of Information Security, Xidian University, Xi’an, 710071, China

    Guozhen Xiao

Authors
  1. Shimin Wei
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Guolong Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Guozhen Xiao
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. State Key Laboratory of Information Security, Institution of Software of Chinese Academy of Sciences, 100080, Beijing, China

    Dengguo Feng

  2. SKLOIS Lab, Institute of Software, Chinese Academy of Sciences, 100080, Beijing, P.R. China

    Dongdai Lin

  3. Computer Science Department, Google Inc. and Columbia University, 1214 Amsterdam Avenue, NY 10027, New York, USA

    Moti Yung

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wei, S., Chen, G., Xiao, G. (2005). A Fast Algorithm for Determining the Linear Complexity of Periodic Sequences. In: Feng, D., Lin, D., Yung, M. (eds) Information Security and Cryptology. CISC 2005. Lecture Notes in Computer Science, vol 3822. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11599548_17

Download citation

  • DOI: https://doi.org/10.1007/11599548_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30855-3

  • Online ISBN: 978-3-540-32424-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation