A relationship between linear complexity and k-error linear complexity

IEEE Transactions on Information Theory

Volumn 46, Issue 2, 2000, Pages 694-698

  Kurosawa, Kaoru ^a,b   Sato, Fumio ^b   Sakata, Takahiro ^b   Kishimoto, Wataru ^c  

^a IEEE   (Japan)

^b TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

^c CHIBA UNIVERSITY   (Japan)

Author keywords

Cryptology; Linear complexity; Stream cipher

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS;

LINEAR COMPLEXITY;

BINARY SEQUENCES;

EID: 0033898980     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.825845     Document Type: Article

References (6)

1. C. Ding, G. Xiao, and W. Shan, "The stability theory of stream ciphers," in Springer Verlag, Lecture Notes in Computer Science. New York: Springer-Verlag, 1991, p. 561.
2. F. J. Mac Williams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North-Holland, 1977.
3. J. Massey, "Shift register synthesis and BCH decoding," IEEE Trans. Inform. Theory, vol. IT-15, pp. 122-127, Jan. 1969.
4. J. Massey, D. Costello, and J. Justesen, "Polynomial weights and code constructions," IEEE Trans. Inform. Theory, vol. IT-19, pp. 101-110, Jan. 1973.
5. R. A. Rueppel, Analysis and Design of Stream Ciphers. New York: Springer-Verlag, 1986.
6. M. Stamp and F. Martin, "An algorithm for the k-error linear complexity of binary sequences with period 2"," IEEE Trans. Inform. Theory, vol. 39, pp. 1398-1401, July 1993.