if you take the A5/1 state that produced a keystream with
one bit flipped at a random position in comparison to the keystream
you observed in the burst, what is the probability of finding a connected
state that produced the observed keystream? It would mean that we could
find more hits with the same amount of data. 
And if this is indeed possible: Applying the above algorithm many times,
finding states that produce keystreams more similar to the target keystream,
you could navigate from a random state to a desired state faster than
with bruteforce.
_______________________________________________
A51 mailing list
[email protected]
http://lists.lists.reflextor.com/cgi-bin/mailman/listinfo/a51

Reply via email to