Anzeige
Erschienen in:
2013 | OriginalPaper | Buchkapitel
How to Construct an Ideal Cipher from a Small Set of Public Permutations
verfasst von : Rodolphe Lampe, Yannick Seurin
Erschienen in: Advances in Cryptology - ASIACRYPT 2013
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We show how to construct an ideal cipher with
n
-bit blocks and
n
-bit keys (
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
single-key iterated Even-Mansour cipher
, which encrypts a plaintext
x
∈ {0,1}
n
under a key
k
∈ {0,1}
n
by alternatively xoring the key
k
and applying independent random public
n
-bit permutations
P
1
,…,
P
r
(this construction is also named a
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.