Skip to main content
Conference ProceedingsOPEN ACCESS

The shrinking generator

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1994) 773 LNCS 22-39
DOI: 10.1007/3-540-48329-2_3
250Citations
Citations of this article
64Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We present a new construction of a pseudorandom generator based on a simple combination of two LFSRs. The construction bas attractive properties as simplicity (conceptual and implementation-wise), scalability (hardware and security), proven minimal security conditions (exponential period, exponential linear complexity, good statistical properties), and resistance to known attacks. The construction is suitable for practical implementation of efficient stream cipher cryptosystems.

Cite

CITATION STYLE

APA

Coppersmith, D., Krawczyk, H., & Mansour, Y. (1994). The shrinking generator. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 773 LNCS, pp. 22–39). Springer Verlag. https://doi.org/10.1007/3-540-48329-2_3

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