Keller, Jorg and Sibeyn, J. F. Beyond External Computing: Analysis of the cycle structure of permutations, Proc. Euro-Par 2001.  Home/Search   Document Details and Download   Summary   Related Articles

....nition Cycle structure of Permutation A permutation is a bijection from f1,2, ng to f1,2, ng. By computing the cycle structure of a permutation, we mean to obtain the number of cycles along with their sizes. For example, the permutation (5,3,4,2,6,1) has cycle structure ( 1,5,6) 2,3,4) [1]. De nition Pseudorandom Permutations A family of permutations is said to be pseudo random if it satis es the three properties succinct representation,ecient computation, and indistinguishability [4] De nition (Uniformly) Random Permutation A machine generates (uniformly) random ....

....4.2 Test 2: Cycle length test This test takes into consideration the cycle structure of the permutation. The analysis of the complete cycle structure of the permutation is very expensive. For very large size of the permutation it is not feasible to do it sequentially. Keller and Sibeyn [1] presented an algorithm to perform this analysis on cluster of workstations in c ( ln n ln(P N) n P, where P is the number of processors and N gives the size of the secondary memory of each of the processors. We present the following calculation to show the complexity of the analysis of ....

[Article contains additional citation context not shown here]

Keller, Jorg and Sibeyn, J. F. Beyond External Computing: Analysis of the cycle structure of permutations, Proc. Euro-Par 2001.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC