Paper 2015/579
A Simple Proof of a Distinguishing Bound of Iterated Uniform Random Permutation
Mridul Nandi
Abstract
Let P be chosen uniformly from the set P := Perm(S), the set of all permutations over a set S of size N. In Crypto 2015, Minaud and Seurin proved that for any unbounded time adversary A, making at most q queries, the distinguishing advantage between P^r (after sampling P, compose it for r times) and P, denoted Delta(P^r ; P), is at most (2r + 1)q/N. In this paper we provide an alternative simple proof of this result for an upper bound 2q(r+1)^2/N by using well known coefficient H-technique.
Metadata
- Available format(s)
-
PDF
- Category
- Secret-key cryptography
- Publication info
- Preprint. MINOR revision.
- Keywords
- iterated random permutationblockciphercascade encryption.
- Contact author(s)
- mridul nandi @ gmail com
- History
- 2015-06-18: received
- Short URL
- https://ia.cr/2015/579
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2015/579,
author = {Mridul Nandi},
title = {A Simple Proof of a Distinguishing Bound of Iterated Uniform Random Permutation},
howpublished = {Cryptology {ePrint} Archive, Paper 2015/579},
year = {2015},
url = {https://eprint.iacr.org/2015/579}
}
