In the theory of stream ciphers the termwise product of shift-register sequences plays a crucial role. In this paper we improve and generalize earlier results on the linear complexity of a termwise product of two shift-register sequences and we also provide information on the minimal polynomial of such a product.
['Rainer Göttfert', 'Harald Niederreiter']
On the linear complexity of products of shift-register sequences