Welcome to the resource topic for
**2013/255**

**Title:**

How to Construct an Ideal Cipher from a Small Set of Public Permutations

**Authors:**
Rodolphe Lampe, Yannick Seurin

**Abstract:**

We show how to construct an ideal cipher with n-bit blocks and n-bit keys (\emph{i.e.} a set of 2^n public n-bit permutations) from a small constant number of n-bit random public permutations. The construction that we consider is the \emph{single-key iterated Even-Mansour cipher}, which encrypts a plaintext x\in\{0,1\}^n under a key k\in\{0,1\}^n by alternatively xoring the key k and applying independent random public n-bit permutations P_1,\ldots, P_r (this construction is also named a \emph{key-alternating cipher}). We analyze this construction in the plain indifferentiability framework of Maurer, Renner, and Holenstein (TCC 2004), and show that twelve rounds are sufficient to achieve indifferentiability from an ideal cipher. We also show that four rounds are necessary by exhibiting attacks for three rounds or less.

**ePrint:**
https://eprint.iacr.org/2013/255

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

**Example resources include:**
implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .