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...

Mice deficient in the transcription factor early B-cell factor 1 (Ebf1) lack mature B lymphocytes but have additional phenotypes suggesting functions outside the hematopoietic system. Fretz et al. report that these mice also exhibit quantitative and qualitative developmental renal defects and develop progressive podocyte foot process effacement. The findings not only suggest that Ebf1 may be pi...

Motivated by a Bayesian framework, we propose a new minimum aberration type criterion for designing experiments with twoand four-level factors. The Bayesian approach helps in overcoming the ad hoc nature of effect ordering in the existing minimum aberration type criteria. Moreover, the approach is also capable of distinguishing between qualitative and quantitative factors. Numerous examples are...

The distinguishing number D(G) of a graph G is the least integer d such that has vertex labeling with labels preserved only by trivial automorphism. Let ? be group acting on set X. for this action X, denoted D? (X), smallest natural k elements X can labeled so any label-preserving element fixes all x ? In particular, if faithful, then preserving identity. paper, we obtain an upper bound knowing...

Albertson and Collins defined the distinguishing number of a graph to be the smallest number of colors needed to color its vertices so that the coloring is preserved only by the identity automorphism. Collins and Trenk followed by defining the distinguishing chromatic number of a graph to be the smallest size of a coloring that is both proper and distinguishing. We show that, with two exception...