Your browser does not support JavaScript!

Global linear complexity analysis of filter keystream generators

Global linear complexity analysis of filter keystream generators

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
IEE Proceedings - Computers and Digital Techniques — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

An efficient algorithm for computing lower bounds on the global linear complexity of nonlinearly filtered PN-sequences is presented. The technique here developed is based exclusively on the realisation of bitwise logic operations, which makes it appropriate for both software simulation and hardware implementation. The algorithm can be applied to any arbitrary nonlinear function with a unique term of maximum order. Thus, the extent of its application for different types of filter generators is quite broad. Furthermore, emphasis is on the large lower bounds obtained that confirm the exponential growth of the global linear complexity for the class of nonlinearly filtered sequences.


    1. 1)
      • E.L. Key . An analysis of the structure and complexity of nonlinear binary sequencegenerators. IEEE Trans. , 732 - 736
    2. 2)
      • J.L. Massey . Shift-register synthesis and BCH decoding. IEEE Trans. , 122 - 127
    3. 3)
      • D.E. Knuth . (1981) The art of computer programming, vol.2: seminumerical algorithms.
    4. 4)
      • R.A. Rueppel . (1986) Analysis and design of stream ciphers.
    5. 5)
      • G.J. Simmons . (1991) Contemporary cryptology: The science of information integrity.
    6. 6)
      • A. Fúster-Sabater , P. Caballero-Gil . (1995) On the linear complexity of nonlinearly filtered PN-sequences, Advances in cryptology-ASIACRYPT'94, Lecture Notes in Computer Science,vol.917.
    7. 7)
      • E.J. Groth . Generation of binary sequences with controllable complexity. IEEE Trans.
    8. 8)
      • J.L. Massey , S. Serconek . (1994) A Fourier transform approach to the linear complexity ofnonlinearly filtered sequences, Advances in cryptology-CRYPTO'94, Lecture Notes inComputer Science vol. 839.
    9. 9)
      • P.V. Kumar , R.A. Scholtz . Bounds on the linear span of bent sequences. IEEE Trans. , 854 - 862

Related content

This is a required field
Please enter a valid email address