Computing the error linear complexity spectrum of a binary sequence of period 2n

IEEE Transactions on Information Theory

Volumn 49, Issue 1, 2003, Pages 273-280

  Lauder, Alan G B ^a,b   Paterson, Kenneth G ^a,c  

^a HEWLETT PACKARD LABORATORIES   (United Kingdom)

^b UNIVERSITY OF OXFORD   (United Kingdom)

^c UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Algorithm; Cryptography; Decoding; Error linear complexity spectrum; Linear complexity; Reed Muller code; Stream cipher

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; ERROR CORRECTION; SPECTRUM ANALYSIS;

REED-MULLER CODE;

BINARY SEQUENCES;

EID: 0037265421     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2002.806136     Document Type: Article

References (22)

1. S. R. Blackburn, "A generalization of the discrete Fourier transform: Determining the minimal polynomial of a periodic sequence," IEEE Trans. Inform. Theory, vol. 40, pp. 1702-1704, Sept. 1994.
2. _, private communication.
3. S. R. Blackburn, T. Etzion, and K. G. Paterson, "Permutation polynomials, de Bruijn sequences and linear complexity," J. Comb. Theory, ser. A, vol. 76, pp. 55-82, 1996.
4. A. H. Chan, R. A. Games, and E. L. Key, "On the complexities of de Bruijn sequences," J. Comb. Theory, ser. A, vol. 33, pp. 233-246, 1982.
5. C. Ding, "Lower bounds on the weight complexities of cascaded binary sequences," in Advances in Cryptology-AUSCRYPT'90 (Lecture Notes in Computer Science), J. Seberry and J. Pieprzyk, Eds. Berlin, Germany: Springer-Verlag, 1991, vol. 453, pp. 39-43.
6. C. Ding, G. Xiao, and W. Shan, The Stability Theory of Stream Ciphers (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1991, vol. 561.
7. T. Etzion, "Constructions for perfect maps and pseudo-random arrays," IEEE Trans. Inform. Theory, vol. 34, pp. 1308-1316, Sept. 1988.
8. T. Etzion and A. Lempel, "Construction of de Bruijn sequences of minimal complexity," IEEE Trans. Inform. Theory, vol. IT-30, pp. 705-709, Sept. 1984.
9. n," IEEE Trans. Inform. Theory, vol. IT-29, pp. 144-146, Jan. 1983.
10. P. A. Hines, "Characterising the linear complexity of span 1 de Bruijn sequences over finite fields," J. Combin. Theory, ser. A, vol. 81, no. 2, pp. 140-148, 1998.
11. _, "On the minimum linear complexity of de Bruijn sequences over nonprime finite fields," J. Combin. Theory, ser. A, vol. 86, no. 1, pp. 127-139, 1999.
12. n," in Concurrency and Parallelism, Programming, Networking (Lecture Notes in Computer Science), J. Jaffar and R. H. C. Yap, Eds. Berlin, Germany: Springer-Verlag, 1996, vol. 1179, pp. 182-191.
13. n, p a prime," Inform. Comput., vol. 151, pp. 134-147, 1999.
14. K. Kurosawa, F. Sato, T. Sakata, and W. Kishimoto, "A relationship between linear complexity and k-error linear complexity," IEEE Trans. Inform. Theory, vol. 46, pp. 694-698, Mar. 2000.
15. J. L. Massey, "Shift register synthesis and BCH decoding," IEEE Trans. Inform. Theory, vol. IT-15, pp. 122-127, Jan. 1969.
16. J. L. Massey, D. J. Costello, and J. Justesen, "Polynomial weights and code constructions," IEEE Trans. Inform. Theory, vol. IT-19, pp. 101-110, Jan. 1973.
17. J. L. Massey and S. Serconek, "Linear complexity of periodic sequences: A general theory," in Advances in Cryptology-CRYPTO'96 (Lecture Notes in Computer Science), N. Koblitz, Ed. Berlin, Germany: Springer-Verlag, 1996, vol. 1109, pp. 358-371.
18. H. Niederreiter, "Some computable complexity measures for binary sequences," in Sequences and Their Applications-Proc. SETA98, C. Ding, T. Helleseth, and H. Niederreiter, Eds. Berlin, Germany: Springer-Verlag, 1999, pp. 67-78.
19. K. G. Paterson, "Perfect maps," IEEE Trans. Inform. Theory, vol. 40, pp. 743-753, May 1994.
20. n," Des., Codes Cryptogr., vol. 4, no. 3, pp. 263-269, 1994.
21. R. A. Rueppel, Analysis and Design of Stream Ciphers. Berlin, Germany: Springer-Verlag, 1986.
22. n," IEEE Trans. Inform. Theory, vol. 39, pp. 1398-1401, July 1993.