On the linear complexity of nonlinearly filtered pn-sequences
From MaRDI portal
Publication:3547152
DOI10.1109/TIT.2003.818400zbMath1301.94099MaRDI QIDQ3547152
Nicholas Kalouptsidis, Nicholas Kolokotronis
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
94A55: Shift register sequences and sequences over finite alphabets in information and communication theory
Related Items
A new complexity metric for FH/SS sequences using fuzzy entropy, Cryptographic properties of nonlinear pseudorandom number generators, Factorization of determinants over finite fields and application in stream ciphers, Improved Bounds on the Linear Complexity of Keystreams Obtained by Filter Generators