Paper 2013/560 Original: eprint.iacr.org/2013/560 ↗
Sometimes-Recurse Shuffle: Almost-Random Permutations in Logarithmic Expected Time
Abstract
We describe a security-preserving construction of a random permutation of domain size~$N$ from a random function, the construction tolerating adversaries asking all~$N$ plaintexts, yet employing just $\Theta(\lg N)$ calls, on average, to the one-bit-output random function. The approach is based on card shuffling. The basic idea is to use the \textit{sometimes-recurse} transformation: lightly shuffle the deck (with some other shuffle), cut the deck, and then recursively shuffle one of the two halves. Our work builds on a recent paper of Ristenpart and Yilek.
Metadata
- Available format(s)
PDF- Category
- Secret-key cryptography
- Publication info
- Preprint.
- History
- 2014-04-02: last updated
- 2013-09-04: published
- Short URL
- https://ia.cr/2013/560
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2013/560,
author = {Ben Morris and Phillip Rogaway},
title = {Sometimes-Recurse Shuffle: Almost-Random Permutations in Logarithmic Expected Time},
howpublished = {Cryptology {ePrint} Archive, Paper 2013/560},
year = {2013},
url = {https://eprint.iacr.org/2013/560}
}