Name
Abstract | ||
|---|---|---|
We prove that a balanced 8-round Feistel network is indifferentiable from a random permutation, improving on previous 10-round results by Dachman-Soled et al. and Dai et al. Our simulator achieves security $$Oq^8/2^n$$, similarly to the security of Dai et al. For further comparison, Dachman-Soled et al. achieve security $$Oq^{12}/2^n$$, while the original 14-round simulator of Holenstein et al. achieves security $$Oq^{10}/2^n$$. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/978-3-662-53018-4_4 | CRYPTO |
Keywords | Field | DocType |
Feistel network,Block ciphers | Block cipher,Computer science,Arithmetic,Random permutation,Theoretical computer science | Conference |
Volume | ISSN | Citations |
9814 | 0302-9743 | 6 |
PageRank | References | Authors |
0.42 | 24 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yuanxi Dai | 1 | 17 | 1.62 |
| John P. Steinberger | 2 | 329 | 18.30 |