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.
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for freeCite
CITATION STYLE
APA
Göttfert, R., & Niederreiter, H. (1994). On the linear complexity of products of shift-register sequences. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 765 LNCS, pp. 151–158). Springer Verlag. https://doi.org/10.1007/3-540-48285-7_13
Readers over time
Readers' Seniority
Readers' Discipline
