[Resource Topic] 2005/126: On the Statistically Optimal Divide and Conquer Correlation Attack on the Shrinking Generator

Welcome to the resource topic for 2005/126

Title:
On the Statistically Optimal Divide and Conquer Correlation Attack on the Shrinking Generator

Authors: Shahram Khazaei, Mahmood Salmasizadeh, 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 [5] and [3], in the sense of minimum required output length. Our simulation results show that our measure reduces the required output length.

ePrint: https://eprint.iacr.org/2005/126

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .