分组密码PRESENT算法基于MILP的分析

Analysis of PRESENT block cipher based on MILP

CHES2007上提出的PRESENT算法是一种轻量级分组密码算法,密钥分为80 bit和128 bit两个版本,攻击者使用包括不可能差分分析在内的多种方法对其进行分析。MILP是一种常用在解决优化商业经济问题的方法,使用这种方法可以有效降低设计与密码分析的工作量。使用MILP方法对PRESENT算法的不可能差分分析进行研究,最后得到PRESENT算法不可能差分特征的最优解。

CHES2007 proposed a lightweight block cipher algorithm is PRESENT algorithm. The key is divided into two versions, such as 80 bit and 128 bit, the attacker uses a variety of methods including the impossible differential analysis to its analysis. This paper used mixed integer linear programming （ MILP）, and frequently used this method in business and economics to solve optimization problems. This technique significantly reduced the workload of designers and cryptanalysts. This paper used this method to analyze the PRESENT algorithm, used the MILP method to get the optimal solution of the PRESENT algorithm which was the impossible differential characteristic.