Inversion Attack and Branching

Abstract

The generalized inversion attack on nonlinear filter generators is developed and analyzed by the theory of critical branching processes. Unlike the inversion attack which requires that the filter function be linear in the first or the last input variable, this attack can be applied for any filter function. Both theory and systematic experiments conducted show that its time complexity remains close to 2 , M being the input memory size, while the additional memory space required is relatively small for most the filter functions.

DOI: 10.1007/3-540-48970-3_8

Extracted Key Phrases

5 Figures and Tables

Cite this paper

@article{Golic1999InversionAA, title={Inversion Attack and Branching}, author={Jovan Dj. Golic and Andrew J. Clark and Ed Dawson}, journal={Australian Computer Journal}, year={1999}, volume={31}, pages={44-53} }