Indifferentiability of 8-Round Feistel Networks.
CRYPTO(2016)
摘要
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$.
更多查看译文
关键词
Feistel network,Block ciphers
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络