Welcome to the resource topic for 2015/1069
Title:
Indifferentiability of 8-Round Feistel Networks
Authors: Yuanxi Dai, John Steinberger
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.
ePrint: https://eprint.iacr.org/2015/1069
Talk: https://www.youtube.com/watch?v=3kr6DbulIVc
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 .