On the stability of 2^n-periodic binary sequences

Warning The system is temporarily closed to updates for reporting purpose.

Meidl, Wilfried (2005) On the stability of 2^n-periodic binary sequences. IEEE Transactions On Information Theory, 51 (3). pp. 1151-1155. ISSN 0018-9448

[thumbnail of 3011800001075.pdf] PDF
3011800001075.pdf
Restricted to Repository staff only

Download (208kB) | Request a copy

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 2(n)-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 2(n), and the exact formula of the expected 1-error linear complexity of a random 2(n)-periodic binary sequence are provided. For k greater than or equal to 2, lower and upper bounds on the expected value of the k-error linear complexity of a random 2(n)-periodic binary sequence are established.
Item Type: Article
Uncontrolled Keywords: cryptography; Chan-Games algorithm; (k-error) linear complexity; periodic sequences; stability of stream ciphers
Subjects: Q Science > QA Mathematics
Divisions: Faculty of Engineering and Natural Sciences
Depositing User: Wilfried Meidl
Date Deposited: 22 Dec 2005 02:00
Last Modified: 23 Sep 2009 11:09
URI: https://research.sabanciuniv.edu/id/eprint/677

Actions (login required)

View Item
View Item