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

Research output: Contribution to journalArticlepeer-review

6 Scopus citations

Abstract

P ∈ SN is a fast forward permutation if for each m the computational complexity of evaluating Pm(x) is small independently of m and x. Naor and Reingold constructed fast forward pseudorandom cycluses and involutions. By studying the evolution of permutation graphs, we prove that the number of queries needed to distinguish a random cyclus from a random permutation in SN is Θ(N) if one does not use queries of the form Pm(x), but is only Θ(1) if one is allowed to make such queries. We construct fast forward permutations which are indistinguishable from random permutations even when queries of the form Pm(x) are allowed. This is done by introducing an efficient method to sample the cycle structure of a random permutation, which in turn solves an open problem of Naor and Reingold.

Original languageEnglish
Pages (from-to)104-121
Number of pages18
JournalJournal of Algorithms
Volume47
Issue number2
DOIs
StatePublished - Jul 2003

Keywords

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

Fingerprint

Dive into the research topics of 'Permutation graphs, fast forward permutations, and sampling the cycle structure of a permutation'. Together they form a unique fingerprint.

Cite this