Correlation analysis of the shrinking generator

37Citations
Citations of this article
46Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The shrinking generator is a well-known keystream generator composed of two linear feedback shift registers, LFSR1 and LFSR2, where LFSR1 is clock-controlled according to regularly clocked LFSR2. A probabilistic analysis of the shrinking generator which shows that this generator can be vulnerable to a specific fast correlation attack is conducted. The first stage of the attack is based on a recursive computation of the posterior probabilites of individual bits of the regularly clocked LFSR1 sequence when conditioned on a given segment of the keystream sequence. Theoretical analysis shows that these probabilities are significantly different from one half and can hence be used for reconstructing the initial state of LFSR1 by iterative probabilistic decoding algorithms for fast correlation attacks on regularly clocked LFSR's. In the second stage of the attack, the initial state of LFSR2 is reconstructed in a similar way, which is based on a recursive computation of the posterior probabilites of individual bits of the LFSR2 sequence when conditioned on the keystream sequence and on the reconstructed LFSR1 sequence. © Springer-Verlag Berlin Heidelberg 2001.

Cite

CITATION STYLE

APA

Golić, J. D. (2001). Correlation analysis of the shrinking generator. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2139 LNCS, pp. 440–457). Springer Verlag. https://doi.org/10.1007/3-540-44647-8_26

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