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
Root Counting, the DFT and the Linear Complexity of Nonlinear Filtering
Designs, Codes and Cryptography
Linear complexity, k-error linear complexity, and the discrete Fourier transform
Journal of Complexity
Linear Complexity of Periodic Sequences: A General Theory
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
The expected value of the joint linear complexity of periodic multisequences
Journal of Complexity
Extended games-Chan algorithm for the 2-adic complexity of FCSR-sequences
Theoretical Computer Science
A wide family of nonlinear filter functions with a large linear span
Information Sciences—Informatics and Computer Science: An International Journal
Expansion and linear complexity of the coordinate sequences over Galois rings
Journal of Complexity
On the counting function of the lattice profile of periodic sequences
Journal of Complexity
On Independence and Sensitivity of Statistical Randomness Tests
SETA '08 Proceedings of the 5th international conference on Sequences and Their Applications
Expansion and linear complexity of the coordinate sequences over Galois rings
Journal of Complexity
On the number of equivalence classes in certain stream ciphers
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
SETA'10 Proceedings of the 6th international conference on Sequences and their applications
Linear filtering of nonlinear shift-register sequences
WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
Nonlinear complexity of binary sequences and connections with lempel-ziv compression
SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
Lower bounds on sequence complexity via generalised vandermonde determinants
SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
ICISC'05 Proceedings of the 8th international conference on Information Security and Cryptology
| Hi-index | 0.00 |
A method for analyzing the linear complexity of nonlinear filterings of PN-sequences that is based on the Discrete Fourier Transform is presented. The method makes use of "Blahut's theorem", which relates the linear complexity of an N-periodic sequence in GF(q)N and the Hamming weight of its frequency-domain associate. To illustrate the power of this approach, simple proofs are given of Key's bound on linear complexity and of a generalization of a condition of Groth and Key for which equality holds in this bound.