Binary sequences generated by nonlinearly filtering maximal length sequences with period 2 n ∈-∈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 linearized polynomials over finite fields of characteristic 2 and then by applying the above to simplify generalizations of the root presence test. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Kolokotronis, N., Limniotis, K., & Kalouptsidis, N. (2008). Improved bounds on the linear complexity of keystreams obtained by filter generators. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4990 LNCS, pp. 246–255). https://doi.org/10.1007/978-3-540-79499-8_20
Mendeley helps you to discover research relevant for your work.