On the expected value of the linear complexity and the κ-error linear complexity of periodic sequences

IEEE Transactions on Information Theory

Volumn 48, Issue 11, 2002, Pages 2817-2825

  Meidl, Wilfried ^a   Niederreiter, Harald ^b  

^a ERICH SCHMID INSTITUTE OF MATERIALS SCIENCE   (Austria)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

error linear complexity; Generalized discrete Fourier transform (GDFT); Linear complexity; Periodic sequences; Stream ciphers

Indexed keywords

COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; DISCRETE FOURIER TRANSFORMS; ERROR ANALYSIS; POLYNOMIALS; RANDOM PROCESSES; SHIFT REGISTERS;

GENERALIZED DISCRETE FOURIER TRANSFORM; LINEAR COMPLEXITY; PERIODIC BINARY SEQUENCES; STREAM CIPHERS;

BINARY SEQUENCES;

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

References (15)

1. R. E. Blahut, Theory and Practice of Error Control Codes. Reading, MA: Addison-Wesley, 1983.
2. H. Hasse, "Theorie der höheren Differentiale in einem algebraischen Funktionenkörper mit vollkommenem Konstantenkörper bei beliebiger Charakteristik," J. Reine Angew. Math., 175, pp. 50-54, 1936.
3. n," in Sequences and Their Applications, C. Ding, T. Helleseth, and H. Niedereiter, Eds. London, U.K.: Springer, 1999, pp. 284-296.
4. R. Lidl and H. Niederreiter, Finite Fields. Reading, MA: Addison-Wesley, 1983.
5. J. L. Massey, "Review of 'Theory and practice of error control codes' (Blahut, R. E.; 1983)," IEEE Trans. Inform. Theory, IT-31 pp. 553-554, July 1985.
6. J. L. Massey and S. Serconek, "A Fourier transform approach to the linear complexity of nonlinearly filtered sequences," in Advances in Cryptology-CRYPTO '94 (Lecture Notes in Computer Science), Y. G. Desmedt, Ed. Berlin, Germany: Springer-Verlag, 1994, vol. 839, pp. 332-340.
7. ____, "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.
8. W. Meidl and H. Niederreiter, "Counting functions and expected values for the k-error linear complexity," Finite Fields Appl., vol. 8, pp. 142-154, 2002.
9. ____, "Linear complexity, k-error linear complexity, and the discrete Fourier transform," J. Complexity, vol. 18, pp. 87-103, 2002.
10. H. Niederreiter, "Some computable complexity measures for binary sequences," in Sequences and Their Applications, C. Ding. T. Helleseth, and H. Niederreiter, Eds. London, U.K.: Springer-Verlag, 1999, pp. 67-78.
11. H. Niederreiter and H. Paschinger, "Counting functions and expected values in the stability theory of stream ciphers," in Sequences and Their Applications, C. Ding, T. Helleseth, and H. Niederreiter, Eds. London, U.K.: Springer-Verlag, 1999, pp. 318-329.
12. R. A. Rueppel, Analysis and Design of Stream Ciphers. Berlin, Germany: Springer-Verlag, 1986.
13. ____, "Stream ciphers," in Contemporary Cryptology: The Science of Information Integrity, G. J. Simmons, Ed. New York: IEEE, 1992, pp. 65-134.
14. D. Shanks, Solved and Unsolved Problems in Number Theory, 2nd ed. New York: Chelsea, 1978.
15. n," IEEE Trans. Inform. Theory, 39, pp. 1398-1401, July 1993.