Fast algorithms for determining the linear complexity of period sequences

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2551, Issue , 2002, Pages 12-21

  Xiao, Guozhen ^a   Wei, Shimin ^b  

^a XIDIAN UNIVERSITY   (China)

^b PEKING UNIVERSITY   (China)

Author keywords

Cryptography; Fast algorithm; K error linear complexity; Linear complexity; Periodic sequence

Indexed keywords

COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY;

FAST ALGORITHMS; GENERALIZED ALGORITHMS; K ERROR LINEAR COMPLEXITY; LINEAR COMPLEXITY; MINIMAL POLYNOMIALS; ODD PRIME; PERIODIC SEQUENCE; PRIMITIVE ROOTS;

POLYNOMIALS;

EID: 84974676498     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36231-2_2     Document Type: Conference Paper

References (19)

1. A.V. Aho, J. E. Hopcroft, J.D. Ullman, The Design and Analysis of Computer Algorithms. Reading, MA: Addision-Wesley, 1974.
2. S.R. Blackburn,”A generalisation of the discrete Fourier transform: determining the minimal polynomial of a periodic sequence”, IEEE Trans. Inform. Theory, Vol. 40, pp.1702-1704, 1994.
3. S.R. Blackburn,”Fast rational interpolation, Reed-Solomon decoding, and the linear complexity profiles of sequences”, IEEE Trans. Inform. Theory, Vol. 43, pp. 537-548, 1997.
4. C. Ding, G. Xiao and W. Shan, The stability theory of stream ciphers, Springer- Verlag, Berlin Heidelberg, 1991.
5. n”, IEEE Trans. Inform. Theory, vol. 29, pp. 144-146, 1983.
6. K. Ireland and M. Rosen, A classical introduction to modern number theory, Graduate Texts in Mathematics No. 84, Springer, New York, 1982.
7. n, p a prime”, Information and Computation, Vol. 151, pp.134-147, 1999.
8. R. Lidl and H. Niederreiter, Finite Fields, Addison-Wesley Publishing Company, 1983.
9. J. L. Massay,”Shift-register synthesis and BCH decoding”, IEEE Trans. Inform. Theory, Vol. 15, pp. 122-127, 1969.
10. R. J. McEliece, Finite fields for computer scientists and engineers, Kluwer Academic Publishers, 1987.
11. K.H. Rosen, Elementary number theory and its applications, Addison-Wesley Publishing Company, 1988.
12. n, IEEE Trans on Inform. Theory, vol. 39, pp. 1398-1401, 1993.
13. S. Wei, An efficient algorithm for the linear complexity of a class of periodic sequences, Proceeding of ChinaCrypto’2002, Publishing House of Electronics Industry, Beijing, 2002.
14. S. Wei, Z. Chen and G. Xiao, A fast algorithm for k-error linear complexity of a binary sequence. 2001 International Conferences on Info-tech and Info-net Proceedings, IEEE Press, 2001, No Conferences E, 152-157.
15. n over GF(q) IEEE Trans. On Information Theory, 2002, 48(9). (to appear)
16. S Wei, G Xiao and Z Chen, An Efficient Algorithm for k-Error Linear Complexity. Chinese Journal of Electronics 2002 11(2):265-267.
17. m, Science in China, Series F, 2001, 44(6):453-460.
18. G. Xiao, S. Wei, K. Imamura and K.Y. Lam, Algorithms for Determingning the Liner complexity Proceeding of International workshop on Cryptographic and- Commerce (CrypTEC’99), July 1999,Hong Kong, 31-36.
19. n over GF (q)”, IEEE Trans. Inform. Theory, 2000, 46(6): 2203-2206.