On the linear complexity of nonlinearly filtered pn-sequences

DOI10.1109/TIT.2003.818400zbMath1301.94099OpenAlexW2130257933MaRDI QIDQ3547152

Nicholas Kalouptsidis, Nicholas Kolokotronis

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2003.818400

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Related Items (5)

A new complexity metric for FH/SS sequences using fuzzy entropy ⋮ Improved Bounds on the Linear Complexity of Keystreams Obtained by Filter Generators ⋮ Cryptographic properties of nonlinear pseudorandom number generators ⋮ Binary sequences with period \(N\) and nonlinear complexity \(N - 2\) ⋮ Factorization of determinants over finite fields and application in stream ciphers

This page was built for publication: On the linear complexity of nonlinearly filtered pn-sequences