Meidl, Wilfried (2008) Reducing the calculation of the linear complexity of binary u2^vperiodic sequences to GamesChan algorithm. Designs, Codes and Cryptography, 46 (1). pp. 5765. ISSN 09251022
This is the latest version of this item.
PDF
DCC2008.pdf
Restricted to Registered users only
Download (186kB)  Request a copy
DCC2008.pdf
Restricted to Registered users only
Download (186kB)  Request a copy
Official URL: http://dx.doi.org/10.1007/s106230079134x
Abstract
We show that the linear complexity of a $u2^v$periodic binary sequence, $u$ odd, can easily be calculated from the linear complexities of certain $2^v$periodic binary sequences. Since the linear complexity of a $2^v$periodic binary sequence can efficiently be calculated with the GamesChan algorithm, this leads to
attractive procedures for the determination of the linear complexity of a $u2^v$periodic binary sequence. Realizations are presented for $u = 3,5,7,15$.
Item Type:  Article 

Uncontrolled Keywords:  Linear complexity  GamesChan algorithm  Binary sequences  Stream cipher 
Subjects:  Q Science > QA Mathematics 
Divisions:  Faculty of Engineering and Natural Sciences 
Depositing User:  Wilfried Meidl 
Date Deposited:  08 Jun 2008 18:46 
Last Modified:  25 May 2011 14:22 
URI:  https://research.sabanciuniv.edu/id/eprint/8598 
Available Versions of this Item

Reducing the calculation of the linear complexity of binary u2^vperiodic sequences to GamesChan algorithm. (deposited 16 Nov 2007 11:49)
 Reducing the calculation of the linear complexity of binary u2^vperiodic sequences to GamesChan algorithm. (deposited 08 Jun 2008 18:46) [Currently Displayed]