Conference ProceedingsOPEN ACCESS

Sequences with almost perfect linear complexity profile

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1988) 304 LNCS 37-51
DOI: 10.1007/3-540-39118-5_5
57Citations
Citations of this article
34Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Stream ciphers are based on pseudorandom key streams, i.e. on deterministically generated sequences of bits with acceptable properties of unpredictability and randomness (see [4, ch. 9], [9]

Cite

CITATION STYLE

APA

Niederreiter, H. (1988). Sequences with almost perfect linear complexity profile. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 304 LNCS, pp. 37–51). Springer Verlag. https://doi.org/10.1007/3-540-39118-5_5

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