International Association for Cryptologic Research

International Association
for Cryptologic Research

IACR News item: 27 May 2015

Brice Minaud, Yannick Seurin
ePrint Report ePrint Report
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.

Expand

Additional news items may be found on the IACR news page.