Analysis and design of stream ciphers
Analysis and design of stream ciphers
Introduction to finite fields and their applications
Introduction to finite fields and their applications
A Fourier Transform Approach to the Linear Complexity of Nonlinearly Filtered Sequences
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
On the Linear Complexity of Nonlinear Filtered PN-sequences
ASIACRYPT '94 Proceedings of the 4th International Conference on the Theory and Applications of Cryptology: Advances in Cryptology
Linear Span Analysis of a Set of Periodic Sequence Generators
Proceedings of the 5th IMA Conference on Cryptography and Coding
d-form sequences: families of sequences with low correlation values and large linear spans
IEEE Transactions on Information Theory
On the Minimal Polynomial of the Product of Linear Recurring Sequences
Finite Fields and Their Applications
Improved Bounds on the Linear Complexity of Keystreams Obtained by Filter Generators
Information Security and Cryptology
A survey of recent attacks on the filter generator
AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes
On attacks on filtering generators using linear subspace structures
SSC'07 Proceedings of the 2007 international conference on Sequences, subsequences, and consequences
Linear filtering of nonlinear shift-register sequences
WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
Lower bounds on sequence complexity via generalised vandermonde determinants
SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
| Hi-index | 0.00 |
The method of root counting is a well established technique in thestudy of the linear complexity of sequences. Recently, Massey and Serconek[11] have introduced a Discrete Fourier Transform approach to the study oflinear complexity. In this paper, we establish the equivalence of these twoapproaches. The power of the DFT methods are then harnessed to re-deriveRueppel‘s Root Presence Test, a key result in the theory of filtering ofm-sequences, in an elegant and concise way. The application of Rueppel‘sTest is then extended to give lower bounds on linear complexity for newclasses of filtering functions.