Reducing the calculation of the linear complexity of u2v-periodic binary sequences to Games---Chan algorithm

Authors:
Wilfried Meidl
Affiliations:
MDBF, Sabancı University, Istanbul, Turkey 34956
Venue:
Designs, Codes and Cryptography
Year:
2008

Citing 7
Cited 1

Analysis and design of stream ciphers

Analysis and design of stream ciphers
Fast Algorithms for Determining the Linear Complexity of Period Sequences

INDOCRYPT '02 Proceedings of the Third International Conference on Cryptology: Progress in Cryptology
The expected value of the joint linear complexity of periodic multisequences

Journal of Complexity
Discrete fourier transform, joint linear complexity and generalized joint linear complexity of multisequences

SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
A fast algorithm for determining the linear complexity of a sequence with period pn over GF(q)

IEEE Transactions on Information Theory
Fast algorithms for determining the linear complexity of sequences over GF(pm) with period 2tn

IEEE Transactions on Information Theory
Reducing the Computation of Linear Complexities of Periodic Sequences Over

IEEE Transactions on Information Theory

Quadratic functions with prescribed spectra

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.00

Visualization

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 Games-Chan 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.