On functions of linear shift register sequences
Proc. of a workshop on the theory and application of cryptographic techniques on Advances in cryptology---EUROCRYPT '85
Products of linear recurring sequences with maximum complexity
IEEE Transactions on Information Theory
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
Shift Register Sequences
Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar
Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar
Linear complexity of periodically repeated random sequences
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Sequences with almost perfect linear complexity profile
EUROCRYPT'87 Proceedings of the 6th annual international conference on Theory and application of cryptographic techniques
Algebraic attacks on stream ciphers with linear feedback
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Linear filtering of nonlinear shift-register sequences
WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
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 |
We derive a formula for the minimal polynomial of the termwise product of binary sequences of least periods 2N–2. The obtained results are important in the analysis of keystream generators based on binary nonlinear N-stage feedback shift registers producing sequences of period 2N–2. Sequences of period 2N–1 are also considered.