New Method for Bounding the Maximum Differential Probability for SPNs and ARIA

详细信息    查看全文

• 作者：Hong-Su Cho ; Soo Hak Sung ; Daesung Kwon ; Jung-Keun Lee ; Jung Hwan Song ; et al.
• 关键词：Cryptography ; Differential cryptanalysis ; Linear cryptanalysis ; Substitution ; permutation networks ; Branch number ; Independent variables ; AES ; ARIA
• 刊名：Lecture Notes in Computer Science
• 出版年：2005
• 出版时间：2005
• 年：2005
• 卷：3506
• 期：1
• 页码：p.21
• 全文大小：253 KB

文摘

By considering the number of independent variables, we present a new method for finding an upper bound on the maximum differential probability (MDP) for r(r ≥ 2)-round substitution-permutation networks (SPNs). It first finds an upper bound for 2-round SPNs and then uses a recursive technique for r(r ≥ 3)-round SPNs. Our result extends and sharpens known results in that it is more effective for calculating MDP for r(r ≥ 3)-round SPNs and applicable to all SPNs. By applying our method to ARIA, we get an estimated bound of 1.5 ¡Á 2− 98 on MDP for 6-round ARIA.