Skip to main content
Conference ProceedingsOPEN ACCESS

On the linear complexity of cascaded sequences

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1985) 209 LNCS 99-109
DOI: 10.1007/3-540-39757-4_11
12Citations
Citations of this article
35Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In the papers [1][2] Kjeldsen derived very interesting properties of cascade couple sequence generators. For applications in ciphering we are interested to know the linear complexity of such sequences. In the following we first consider the examples 1 and 2.

Cite

CITATION STYLE

APA

Vogel, R. (1985). On the linear complexity of cascaded sequences. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 209 LNCS, pp. 99–109). Springer Verlag. https://doi.org/10.1007/3-540-39757-4_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free