Name
Title | ||
|---|---|---|
Indifferentiability of Iterated Even-Mansour Ciphers with Non-idealized Key-Schedules: Five Rounds Are Necessary and Sufficient. |
Abstract | ||
|---|---|---|
We prove that the 5-round iterated Even-Mansour (IEM) construction with a non-idealized key-schedule (such as the trivial key-schedule, where all round keys are equal) is indifferentiable from an ideal cipher. In a separate result, we also prove that five rounds are necessary by describing an attack against the corresponding 4-round construction. This closes the gap regarding the exact number of rounds for which the IEM construction with a non-idealized key-schedule is indifferentiable from an ideal cipher, which was previously only known to lie between four and twelve. Moreover, the security bound we achieve is comparable to (in fact, slightly better than) the previously established 12-round bound. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/978-3-319-63697-9_18 | ADVANCES IN CRYPTOLOGY - CRYPTO 2017, PT III |
Keywords | Field | DocType |
Key-alternating cipher,Iterated Even-Mansour construction,Indifferentiability | Cipher,Discrete mathematics,Computer science,Schedule,Iterated function | Conference |
Volume | ISSN | Citations |
10403 | 0302-9743 | 1 |
PageRank | References | Authors |
0.34 | 35 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yuanxi Dai | 1 | 17 | 1.62 |
| Yannick Seurin | 2 | 1444 | 59.24 |
| John P. Steinberger | 3 | 329 | 18.30 |
| Aishwarya Thiruvengadam | 4 | 26 | 2.50 |