Analysis and design of stream ciphers
Analysis and design of stream ciphers
Analysis of a nonlinear feedforward logic for binary sequence generators
Proc. of a workshop on the theory and application of cryptographic techniques on Advances in cryptology---EUROCRYPT '85
Root Counting, the DFT and the Linear Complexity of Nonlinear Filtering
Designs, Codes and Cryptography
On the linear complexity of the sequences generated by nonlinear filterings
Information Processing Letters
Shift Register Sequences
Lower bounds on sequence complexity via generalised vandermonde determinants
SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
On the linear complexity of nonlinearly filtered PN-sequences
IEEE Transactions on Information Theory
A New Attack on the Filter Generator
IEEE Transactions on Information Theory
On the Minimal Polynomial of the Product of Linear Recurring Sequences
Finite Fields and Their Applications
| Hi-index | 0.00 |
Binary sequences generated by nonlinearly filtering maximal length sequences with period 2n茂戮驴 1 are studied in this paper. We focus on the particular class of normal filtersand 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 polynomialsover finite fields of characteristic 2 and then by applying the above to simplify generalizations of the root presence test.