An algorithm for computing lower bounds on the global linear complexity of nonlinearly filtered PN-sequences is presented. Unlike the existing methods, the algorithm here presented is based on the realization of bit wise logic operations. The numerical results obtained are valid for any nonlinear function with a unique term of maximum order and for any maximal-length LFSR. To illustrate the power of this technique, we give some high lower bounds that confirm Rueppel's conclusion about the exponential growth of the linear complexity in filter generators.
CITATION STYLE
Caballero-Gil, P., & Fúster-Sabater, A. (1995). Linear span analysis of a set of periodic sequence generators. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1025, pp. 22–33). Springer Verlag. https://doi.org/10.1007/3-540-60693-9_5
Mendeley helps you to discover research relevant for your work.