Finding Integral Distinguisher and Differential Bound on PRESENT cipher based on Mixed Integer Linear Programming

Mixed integer linear programming (MILP) is a powerful method for block ciphers analysis and optimization as it presents a flexible tool for solving some large, complex problems such as finding active substitution boxes, integral division property cryptanalysis and so on. In this paper, we introduce MILP and supply it to find the number of active S-boxes into the model of block cipher as PRESENT and we discuss about integral analysis. As a new method, we also apply convex shell approach to reduce the complexity and find ۸ round integral distinguisher with memory less than the other one and find ۱۲ round differential characteristic on the PRESENT cipher.

کلیدواژه ها:

MILP ، Integral distinguisher ، differential attack ، Block Cipher ، Convex Shell ، PRESENT