We present an efficient algorithm that can distinguish the keystream of WPA from that of a generic instance of RC4 with a packet complexity of O(N), where N denotes the size of the internal permutation of RC4. In practice, our distinguisher requires approximately 2 packets; thus making it the best known distinguisher of WPA to date. This is a significantly improved distinguisher than the previo...

This paper concerns the problem of testing from a finite state machine (FSM) M modelling a system that interacts with its environment at multiple physically distributed interfaces, called ports. We assume that the distributed test architecture is used: there is a local tester at each port, the tester at port p only observes events at p, and the testers do not interact during testing. This paper...