On the linear complexity of nonlinearly filtered pn-sequences

DOI10.1109/TIT.2003.818400MaRDI QIDQ3547152zbMATH OpenOpenAlexFDO

Authors Nicholas Kolokotronis, N. Kalouptsidis

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)

Recommendations

• scientific article; zbMATH DE number 1024087
• On the linear complexity of the sequences generated by nonlinear filterings
• On the linear complexity parameter and second order nonlinear filters.
• Linear span analysis of a set of periodic sequence generators
• Publication:4940707

Cited in

(28)

• Global linear complexity analysis of filter keystream generators
• scientific article; zbMATH DE number 2104013 (Why is no real title available?)
• Factorization of determinants over finite fields and application in stream ciphers
• Lower Bounds on Sequence Complexity Via Generalised Vandermonde Determinants
• scientific article; zbMATH DE number 1740036 (Why is no real title available?)
• scientific article; zbMATH DE number 1406791 (Why is no real title available?)
• Nonlinear Complexity of Binary Sequences and Connections with Lempel-Ziv Compression
• On the linear complexity parameter and second order nonlinear filters.
• scientific article; zbMATH DE number 3983066 (Why is no real title available?)
• Linear span analysis of a set of periodic sequence generators
• On the linear complexity of nonuniformity decimated PN-sequences
• Improved Bounds on the Linear Complexity of Keystreams Obtained by Filter Generators
• The nonlinear complexity of level sequences over \(\mathbb Z/(4)\)
• A new complexity metric for FH/SS sequences using fuzzy entropy
• Finite length sequences with large nonlinear complexity
• scientific article; zbMATH DE number 1421723 (Why is no real title available?)
• scientific article; zbMATH DE number 4191551 (Why is no real title available?)
• scientific article; zbMATH DE number 4191552 (Why is no real title available?)
• Linearity properties of binary FCSR sequences
• An efficient algorithm to generate binary sequences for cryptographic purposes
• A wide family of nonlinear filter functions with a large linear span
• Binary sequences with period \(N\) and nonlinear complexity \(N - 2\)
• Linear complexity of generalized sequences by comparison of PN-sequences
• Coding and Cryptography
• Cryptographic properties of nonlinear pseudorandom number generators
• On the general classification of nonlinear filters of \(m\)-sequences
• On the linear complexity of the sequences generated by nonlinear filterings
• On the Classification of Periodic Binary Sequences into Nonlinear Complexity Classes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547152)