Skip to main content
SpringerLink
Log in

A fast algorithm for determining the linear complexity of a binary sequence with period 2n p m

  • Scientific Papers
  • Published:
Science in China Series : Information Sciences Aims and scope Submit manuscript

Abstract

An efficient algorithm for determining the linear complexity and the minimal polynomial of a binary sequence with period 2n p m is proposed and proved, where 2 is a primitive root modulop 2. The new algorithm generalizes the algorithm for computing the linear complexity of a binary sequence with period 2n and the algorithm for computing the linear complexity of a binary sequence with periodp n, where 2 is a primitive root modulop 2.

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. Games, R. A., Chan, A. H., A fast algorithm for determining the complexity of a binary sequence with period 2n, IEEE Trans on Information Theory, 1983, 29(1): 144–146.

    Article  MATH  MathSciNet  Google Scholar 

  2. Ding, C. S., Xiao, G. Z., Shan, W. J., The Stability Theory of Stream Ciphers, Berlin/Heidelberg: Springer-Verlag, 1991.

    MATH  Google Scholar 

  3. Ling, X. D., Hu, Z. M., Cai, C. N., Fast algorithms for computing the Boolean polynomial and the linear complexity of periodic sequences, Advances in Cryptography-Chinacrypt’92 (in Chinese), Beijing: Science Press, 1992.

    Google Scholar 

  4. Blackburn, S. R., A generalisation of the discrete Fourier transform: determining the minimal polynomial of a periodic sequence, IEEE Trans on Information Theory, 1994, 40(5): 1702–1704.

    Article  MATH  MathSciNet  Google Scholar 

  5. Wei Shimin, Bai Guoqiang, Xiao Guozhen, A fast algorithm for determining the linear complexity of a binary sequence with periodp n, Journal of Chinese Communications (in Chinese), 1999, 20(8): 36–40.

    Google Scholar 

  6. McEliece, R. J., Finite Fields for Computer Scientists and Engineers, Boston: Kluwer Academic Publishers, 1987.

    MATH  Google Scholar 

  7. Rosen, K. H., Elementary Number Theory and Its Applications, Reading: Addison-Wesley, 1988.

    MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Information Security Research Group, Department of Computer Science and Technique, Peking University, 100871, Beijing, China

    Wei Shimin & Chen Zhong

  2. Department of Mathematics, Huaibei Coal Normal College, 235000, Huaibei, China

    Wei Shimin

  3. National Key Laboratory of ISN, Xidian University, 710071, Xi’an, China

    Wei Shimin & Xiao Guozhen

Authors
  1. Wei Shimin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiao Guozhen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chen Zhong
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wei Shimin.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wei, S., Xiao, G. & Chen, Z. A fast algorithm for determining the linear complexity of a binary sequence with period 2n p m . Sci China Ser F 44, 453–460 (2001). https://doi.org/10.1007/BF02713949

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02713949

Keywords

Search

Navigation