On the linear complexity of the sequences generated by nonlinear filterings
References (10)
- et al.
On the general classification of nonlinear filters of -sequences
Inform. Process. Lett.
(1999) Regular cosets and upper bounds on the linear complexity of certain sequences
- et al.
On the linear complexity of nonlinearly filtered PN-sequences
Shift Register-Sequences
(1967)Generation of binary sequences with controllable complexity
IEEE Trans. Inform. Theory
(1971)
There are more references available in the full text version of this article.
Cited by (11)
Computational intelligence in cryptology
2016, Artificial Intelligence: Concepts, Methodologies, Tools, and ApplicationsAutomated design of stream ciphers using GADS
2015, Improving Information Security Practices through Computational IntelligenceComputational intelligence in cryptology
2015, Improving Information Security Practices through Computational IntelligenceImproving the lower bound on linear complexity of the sequences generated by nonlinear filtering
2012, Chinese Journal of ElectronicsFactorization of determinants over finite fields and application in stream ciphers
2009, Cryptography and CommunicationsFinding linear equivalence of keystream generators using genetic simulated annealing
2008, Information Technology Journal
Copyright © 2000 Elsevier Science B.V. All rights reserved.