[Resource Topic] 2000/042: Constructing Pseudo-Random Permutations with a Prescribed Structure

Welcome to the resource topic for 2000/042

Constructing Pseudo-Random Permutations with a Prescribed Structure

Authors: Moni Naor, Omer Reingold


We show how to construct pseudo-random permutations that satisfy a
certain cycle restriction, for example that the permutation be
cyclic (consisting of one cycle containing all the elements) or an
involution (a self-inverse permutation) with no fixed points. The
construction can be based on any (unrestricted) pseudo-random
permutation. The resulting permutations
are defined succinctly and their
evaluation at a given point is efficient. Furthermore, they enjoy
a {\em fast forward} property, i.e. it is possible to iterate
them at a very small cost.

ePrint: https://eprint.iacr.org/2000/042

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .