Paper 2000/042 Original: eprint.iacr.org/2000/042 ↗
Constructing Pseudo-Random Permutations with a Prescribed Structure
Abstract
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.
Metadata
- Available format(s)
PDF- Category
- Secret-key cryptography
- Publication info
- Preprint.
- History
- 2000-08-11: last updated
- 2000-08-11: published
- Short URL
- https://ia.cr/2000/042
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2000/042,
author = {Moni Naor and Omer Reingold},
title = {Constructing Pseudo-Random Permutations with a Prescribed Structure},
howpublished = {Cryptology {ePrint} Archive, Paper 2000/042},
year = {2000},
url = {https://eprint.iacr.org/2000/042}
}