… We also show that if we are willing to use a much larger family of simple permutations then
we can guarantee closeness to k-wise independence with fewer compositions and fewer …

… needed to achieve a permutation that is close to k-wise … compositions of random permutations
from this family suffice. … use a much larger family of simple permutations then we can …

… question in cryptography is how well the composition of simple permutations drawn from a …
class of width 2 simple permutation, denoted . The action of such a permutation on an element …

… question in cryptography is how well the composition of simple permutations drawn from a
… of width 2 simple permutation, denoted Σ. The action of such a permutation on an element of …

… needed to achieve a permutation that is close to k-wise … , n3k3 compositions of random
permutations from this family suffice. … use a much larger family of simple permutations then we can …

… 4.2 we give a simple characterization of the systems of permutations that can be obtained …
Motivated by Theorem 4.2, we conjectured that the converse statement holds as well (The …

… a mixture of permutations, where each component of the mixture … We study the problem where
the permutations in a mixture … two simple algorithms for the case when the centers are well …

… of permutation methods to be adapted to real-world situations is what led to my writing this
book, aimed at the practitioner, as well … In the simple example analyzed in this chapter, what …

… , then Σ i will vary for each subject as well. A possible solution is represented by pre-weighting
the … This is the case when a mixed effect model is chosen instead of a simple linear model. …

… error terms, as well as on the need to effectively break, at each permutation, the relationship
… This algorithm is simple and has the benefit of generating only permutations that are unique…