On the linear complexity of nonlinearly filtered PN-sequences

Authors:
N. Kolokotronis;N. Kalouptsidis
Affiliations:
Dept. of Informatics & Telecommun., Nat. & Kapodistrian Univ. of Athens, Greece;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 6

On the generation of sequences simulating higher order white noise for system identification

Signal Processing
Cryptographic properties of nonlinear pseudorandom number generators

Designs, Codes and Cryptography
Improved Bounds on the Linear Complexity of Keystreams Obtained by Filter Generators

Information Security and Cryptology
Determining the complexity of FH/SS sequence by approximate entropy

IEEE Transactions on Communications
Nonlinear complexity of binary sequences and connections with lempel-ziv compression

SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
Lower bounds on sequence complexity via generalised vandermonde determinants

SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications

Quantified Score

Hi-index	754.84

Visualization

Abstract

Binary sequences of period 2n-1 generated by a linear feedback shift register (LFSR) whose stages are filtered by a nonlinear function, f, are studied. New iterative formulas are derived for the calculation of the linear complexity of the output sequences. It is shown that these tools provide an efficient mechanism for controlling the linear complexity of the nonlinearly filtered maximal-length sequences.