Given an edit transformation defined by the stop/go clocking in the bilateral stop/go generator, an edit probability for two binary strings of appropriate lengths is proposed. An efficient recursive algorithm for the edit probability computation is derived. It is pointed out how this edit probability can be used to mount a correlation attack on one of two clock-controlled shift registers. By estimating the underlying false alarm probability, it is shown that the minimum output sequence length required to be known for a successful attack is linear in the length of the shift register. This is illustrated by experimental correlation attacks on relatively short shift registers.
['Renato Menicocci', 'Jovan Dj. Golic']
Edit Probability Correlation Attack on the Bilateral Stop/Go Generator