Improved Bounds on the Linear Complexity of Keystreams Obtained by Filter Generators


Binary sequences generated by nonlinearly filtering maximal length sequences with period 2−1 are studied in this paper. We focus on the particular class of normal filters and provide improved lower bounds on the linear complexity of generated keystreams. This is achieved by first proving properties of a special class of determinants which are associated to… (More)
DOI: 10.1007/978-3-540-79499-8_20


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics