[DS16a] Indifferentiability of 8-Round Feistel Networks
Authors: Yuanxi Dai, John Steinberger | Venue: CRYPTO 2016 | Source
Abstract
We prove that a balanced 8-round Feistel network is indifferentiable from a random permutation. This result comes on the heels of (and is part of the same body of work as) a 10-round indifferentiability result for Feistel network recently announced by the same team of authors. The current 8-round simulator achieves similar security, query complexity and runtime as the 10-round simulator and is not significantly more involved. The security of our simulator is also slightly better than the security of the 14-round simulator of Holenstein et al. for essentially the same runtime and query complexity.
BibTeX
@Inproceedings{C:DaiSte16,
author = {Yuanxi Dai and John P. Steinberger},
title = {Indifferentiability of 8-Round {Feistel} Networks},
pages = {95--120},
editor = {Matthew Robshaw and Jonathan Katz},
booktitle = {Advances in Cryptology -- {CRYPTO}~2016, Part~I},
volume = {9814},
series = {Lecture Notes in Computer Science},
address = {Santa Barbara, CA, USA},
month = {aug~14--18},
publisher = {Springer Berlin Heidelberg, Germany},
year = {2016},
doi = {10.1007/978-3-662-53018-4_4},
}