一类非平衡Feistel网络的线性可证明安全性(英文)

作者：王念平; 金晨辉; 余昭平

来源：Applied Mathematics-A Journal of Chinese Universities Series B, 2005, 27-32.

• unbalanced Feistel networks
• provable security against linear attack
• linear hull probabilities
• upper bound.

. A structure iterated by the unbalanced Feistel networks is introduced.It is showed that this structure is provable resistant against linear attack.The main result of this paper is that the upper bound of r-round (r≥2m) linear hull probabilities are bounded by q2 when around function F is bijective and the maximal linear hull probabilities of round function F is q. Application of this structure to block cipher designs brings out the provable security against linear attack with the upper bounds of probabilities.