On the linear complexity of combined shift register sequences
Proc. of a workshop on the theory and application of cryptographic techniques on Advances in cryptology---EUROCRYPT '85
Shift Register Sequences
Galois Switching Functions and Their Applications
IEEE Transactions on Computers
On using prime polynomials in crypto generators
Proceedings of the 1982 conference on Cryptography
On the linear complexity of products of shift-register sequences
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Designs, Codes and Cryptography
Generalization of Siegenthaler Inequality and Schnorr-Vaudenay Multipermutations
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Exploiting Multiples of the Connection Polynomial in Word-Oriented Stream Ciphers
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Ciphertext Only Reconstruction of Stream Ciphers Based on Combination Generators
FSE '00 Proceedings of the 7th International Workshop on Fast Software Encryption
Linearity Properties of the SOBER-t32 Key Loading
FSE '02 Revised Papers from the 9th International Workshop on Fast Software Encryption
Generation of binary sequences with controllable complexity and ideal γ-tupel distribution
EUROCRYPT'87 Proceedings of the 6th annual international conference on Theory and application of cryptographic techniques
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
Pseudorandom sequences and stream ciphers
Algorithms and theory of computation handbook
Analysis and improvement of a pseudorandom number generator for EPC Gen2 tags
FC'10 Proceedings of the 14th international conference on Financial cryptograpy and data security
A Practical Implementation Attack on Weak Pseudorandom Number Generator Designs for EPC Gen2 Tags
Wireless Personal Communications: An International Journal
Performance evaluation of highly efficient techniques for software implementation of LFSR
Computers and Electrical Engineering
SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
On the Minimal Polynomial of the Product of Linear Recurring Sequences
Finite Fields and Their Applications
| Hi-index | 0.00 |
This paper is intended as an overview, presenting several results on the linear complexity of sequences obtained from functions applied to linear shift register sequences. Especially for cryptologic applications it is of course highly desirable that the linear complexity be as large as possible, and not only to get a huge period. The theory reviewed in this paper contains several criteria on how to achieve such goals.