Constructing Mixed-integer Programming Models whose Feasible Region is Exactly the Set of All Valid Dierential Characteristics of SIMON

In IACR ePrint 2014/747, a method for constructing mixed- integer linear programming (MILP) models whose feasible regions are exactly the sets of all possible dierential (or linear) characteristics for a wide range of block ciphers is presented. These models can be used to search for or enumerate dierential