Indifferentiability of 8-round Feistel networks
Y Dai, J Steinberger - Annual International Cryptology Conference, 2016 - Springer
Y Dai, J Steinberger
Annual International Cryptology Conference, 2016•SpringerWe 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 O (q^ 8/2^ n), similarly to the security of Dai et al. For further
comparison, Dachman-Soled et al. achieve security O (q^ 12/2^ n), while the original 14-
round simulator of Holenstein et al. achieves security O (q^ 10/2^ n).
permutation, improving on previous 10-round results by Dachman-Soled et al. and Dai et al.
Our simulator achieves security O (q^ 8/2^ n), similarly to the security of Dai et al. For further
comparison, Dachman-Soled et al. achieve security O (q^ 12/2^ n), while the original 14-
round simulator of Holenstein et al. achieves security O (q^ 10/2^ n).
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 , similarly to the security of Dai et al. For further comparison, Dachman-Soled et al. achieve security , while the original 14-round simulator of Holenstein et al. achieves security .
Springer