A general lower bound for the linear complexity of the product of shift-register sequences. (English) Zbl 0881.94008
De Santis, Alfredo (ed.), Advances in cryptology - EUROCRYPT ’94. Workshop on the theory and application of cryptographic techniques, Perugia, Italy, May 9-12, 1994. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 950, 223-229 (1995).
Summary: The determination of the linear complexity of the product of two shift-register sequences is a basic problem in the theory of stream ciphers. We present for the first time a lower bound for the linear complexity of the product of two shift-register sequences in the general case. Moreover, we provide information on the minimal polynomial of such a product.
For the entire collection see [Zbl 0847.00061].
For the entire collection see [Zbl 0847.00061].
MSC:
| 94A55 | Shift register sequences and sequences over finite alphabets in information and communication theory |
| 94A60 | Cryptography |
