搜索结果: 1-3 共查到“8-Round Feistel Networks”相关记录3条 . 查询时间(0.102 秒)
We prove that a (balanced) 10-round Feistel network is indifferentiable from a random permutation. In a previous seminal result, Holenstein et al. had established indifferentiability of Feistel at 14 ...
Indifferentiability of 8-Round Feistel Networks
Indifferentiability 8-Round Feistel Networks
2015/12/21
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
indifferentiabi...
2-round Substitution-Permutation and 3-round Feistel Networks have bad Algebraic Degree
2-round Substitution-Permutation 3-round Feistel Networks Algebraic Degree
2010/2/20
We study algebraic degree profile of reduced-round block cipher schemes.
We show that the degree is not maximal with elementary combinatorial
and algebraic arguments. We discuss on how it can be tur...