Title :
On the stability of 2n-periodic binary sequences
Author_Institution :
Temasek Labs., Nat. Univ. of Singapore
fDate :
3/1/2005 12:00:00 AM
Abstract :
The k-error linear complexity of a periodic binary sequence is defined to be the smallest linear complexity that can be obtained by changing k or fewer bits per period. This contribution focuses on the case of 2n-periodic binary sequences. For k=1,2, the exact formula for the expected k-error linear complexity of a sequence having maximal possible linear complexity 2n, and the exact formula of the expected 1-error linear complexity of a random 2n-periodic binary sequence are provided. For k ges 2, lower and upper bounds on the expected value of the k-error linear complexity of a random 2n-periodic binary sequence are established
Keywords :
binary sequences; cryptography; 2n periodic binary sequence; Chan-Games algorithm; cryptography; k-error linear complexity; stream cipher stability; Binary sequences; Counting circuits; Cryptography; Galois fields; Linear feedback shift registers; Mathematics; Security; Stability; Upper bound; (; Chan–Games algorithm; Cryptography; periodic sequences; stability of stream ciphers;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2004.842709
