Deterministic Cryptanalysis of some Stream Ciphers
P. Caballero-Gil, A. Fúster-Sabater, C. Hernández-Goya · 2009
A new graph-based approach to edit distance cryptanalysis of some clock-controlled generators is here presented in order to simplify search trees of the original attacks. In particular, the proposed improve- ment is based on cut sets de¯ned on some graphs so that only the most promising branches of the search tree have to be analyzed because cer- tain shortest paths provide the edit distances. The strongest aspects of the proposal are: a) the obtained results from the attack are absolutely deterministic and b) many inconsistent initial states are recognized be- forehand and avoided during search.