On the linear complexity of products of shift-register sequences

  • Authors:
  • Rainer Göttfert;Harald Niederreiter

  • Affiliations:
  • Austrian Academy of Sciences, Vienna;Austrian Academy of Sciences, Vienna

  • Venue:
  • EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
  • Year:
  • 1994

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.