Abstract
Given an edit transformation defined by the stop/go clocking in the alternating step generator, an edit probability for two binary strings of appropriate lengths is proposed. corresponds alternating 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 statistically optimal correlation attack on each of the clock-controlled shift registers individually. 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 respective shift register. This is illustrated by experimental attacks on relatively short shift registers.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
