Optimal impossible differential analysis method with MILP model solvable as a decision condition

Abstract

The application discloses an optimal impossible differential analysis method with a MILP model solvable as a judgment condition, and the core lies in that in the search process of the impossible differential distinguisher, a MILP impossible differential distinguisher search model with solvability as a judgment condition is proposed, then upward and downward expansion is carried out on the searched distinguisher, the key to be guessed is obtained, and finally the minimum guessing base is obtained. Through MILP modeling of the impossible differential distinguisher search and the key recovery attack process as a unified whole with solvability as a judgment condition, the optimal impossible differential distinguisher and the minimum guessing base are obtained through solving the model, and the complexity of the cryptographic algorithm attack is effectively reduced.

Images