Title :
A relationship between linear complexity and k-error linear complexity
Author :
Kurosawa, Kaoru ; Sato, Fumio ; Sakata, Takahiro ; Kishimoto, Wataru
Author_Institution :
Fac. of Eng., Tokyo Inst. of Technol., Japan
fDate :
3/1/2000 12:00:00 AM
Abstract :
Linear complexity is an important cryptographic criterion of stream ciphers. The k-error linear complexity of a periodic sequence of period N is defined as the smallest linear complexity that can be obtained by changing k or fewer bits of the sequence per period. This article shows a relationship between the linear complexity and the minimum value k for which the k-error linear complexity is strictly less than the linear complexity
Keywords :
binary sequences; computational complexity; cryptography; binary sequence; cryptographic criterion; k-error linear complexity; keystream sequence; linear complexity; linear feedback shift register length; minerror; periodic sequence; stream ciphers; Binary sequences; Cryptography; Error correction codes; Hamming weight; Linear feedback shift registers; Polynomials; Sufficient conditions; Upper bound;
Journal_Title :
Information Theory, IEEE Transactions on
