A fast correlation attack on the shrinking generator

Abstract

In this paper we demonstrate a fast correlation attack on the shrinking generator with known connections. Our attack is applicable to arbitrary weight feedback polynomial of the generating LFSR and comparisons with other known attacks show that our attack offers good trade-offs between required keystream length, success probability and complexity. Our result confirms Golić's conjecture that the shrinking generator may be vulnerable to fast correlation attacks without exhaustively searching through all possible initial states of some LFSR is correct. © Springer-Verlag Berlin Heidelberg 2005.