CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
How hard is computing the edit distance?
Information and Computation
A Probabilistic Correlation Attack on the Shrinking Generator
ACISP '98 Proceedings of the Third Australasian Conference on Information Security and Privacy
Correlation Analysis of the Alternating Step Generator
Designs, Codes and Cryptography
A generalized correlation attack with a probabilistic constrained edit distance
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
Improvement of the edit distance attack to clock-controlled LFSR-Based stream ciphers
EUROCAST'05 Proceedings of the 10th international conference on Computer Aided Systems Theory
Embedding probabilities for the Alternating Step Generator
IEEE Transactions on Information Theory
Clock-controlled shift registers: a review
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.09 |
We present a new approach to edit distance attacks on certain clock-controlled generators, which applies basic concepts of Graph Theory to simplify the search trees of the original attacks in such a way that only the most promising branches are analyzed. In particular, the proposed improvement is based on cut sets defined on some graphs so that certain shortest paths provide the edit distances. The strongest aspects of the proposal are that the obtained results from the attack are absolutely deterministic, and that many inconsistent initial states of the target registers are recognized beforehand and avoided during search.