Cryptology ePrint Archive: Report 2005/126
On the Statistically Optimal Divide and Conquer Correlation Attack on the Shrinking Generator
Shahram Khazaei, Mahmood Salmasizadeh and Javad Mohajeri
Abstract: The shrinking generator is a well-known key stream generator composed of two LFSR’s, LFSRx and LFSRc, where LFSRx is clock-controlled according to the regularly clocked LFSRc. In this paper we investigate the minimum required length of the output sequence for successful reconstruction of the LFSRx initial state in an optimal probabilistic divide and conquer correlation attack. We extract an exact expression for the joint probability of the prefix of length m of the output sequence of LFSRx and prefix of length n of the output sequence of the generator. Then we use computer simulation to compare our probability measure and two other probability measures, previousely proposed in  and , in the sense of minimum required output length. Our simulation results show that our measure reduces the required output length.
Category / Keywords: secret-key cryptography / stream ciphers, clock-controlled generators, shrinking generator, divide and conquer attack, optimal correlation attacks, deletion channel, joint probability.
Date: received 26 Apr 2005, last revised 18 May 2012
Contact author: shahram khazaei at gmail com
Available format(s): PDF | BibTeX Citation
Version: 20120519:044853 (All versions of this report)
Short URL: ia.cr/2005/126
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]