Name
Abstract | ||
|---|---|---|
We introduce and study the iterated random permutation problem, which asks how hard it is to distinguish, in a black-box way, the r-th power of a random permutation from a uniformly random permutation of a set of size N. We show that this requires Omega(N) queries (even for a two-sided, adaptive adversary). As a direct application of this result, we show that cascading a block cipher with the same key cannot degrade its security (as a pseudorandom permutation) more than negligibly. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-662-47989-6_17 | ADVANCES IN CRYPTOLOGY, PT I |
Keywords | Field | DocType |
Iterated random permutation problem,Block cipher,Pseudorandom permutation,Cascade encryption | Permutation graph,Discrete mathematics,Combinatorics,Computer science,Random permutation statistics,Cyclic permutation,Random permutation,Theoretical computer science,Bit-reversal permutation,Pseudorandom permutation,Fisher–Yates shuffle,Partial permutation | Conference |
Volume | ISSN | Citations |
9215 | 0302-9743 | 4 |
PageRank | References | Authors |
0.54 | 21 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Brice Minaud | 1 | 147 | 7.75 |
| Yannick Seurin | 2 | 1444 | 59.24 |