Permutation graphs, fast forward permutations, and sampling the cycle structure of a permutation

Journal of Algorithms

Volumn 47, Issue 2, 2003, Pages 104-121

  Tsaban, Boaz ^a  

^a BAR ILAN UNIVERSITY   (Israel)

Author keywords

Cycle structure; Fast forward permutations; Permutation graphs; Pseudorandom permutations

Indexed keywords

COMPUTATIONAL COMPLEXITY; PROBABILITY; QUERY LANGUAGES; RANDOM PROCESSES;

PERMUTATION GRAPHS;

GRAPH THEORY;

EID: 0037635114     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0196-6774(03)00017-8     Document Type: Article

References (4)

1. M. Naor, O. Reingold, Constructing pseudo-random permutations with a prescribed structure, J. Cryptology 14 (2001), to appear.
2. B. Schneier, Applied Cryptography, Wiley, 1996.
3. L.A. Shepp, S.P. Lloyd, Ordered cycle lengths in a random permutation, Trans. Amer. Math. Soc. 121 (1966) 340-357.
4. B. Tsaban, Bernoulli numbers and the probability of a birthday surprise. Discrete Appl. Math., to appear.