Indifferentiability of 8-Round Feistel Networks.

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$$.