A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is
IACR Cryptology ePrint Archive
Inspired by Fu et al. work  on modeling the exclusive-or differential property of the modulo addition as an mixed-integer programming problem, we propose a method with which any finite automaton can be formulated as an mixed-integer programming model. Using this method, we show how to construct a mixed integer programming model whose feasible region is the set of all differential patterns (α, β, γ)'s, such that adp ⊕ (α, β → γ) = Prx,y[((x + α) ⊕ (y + β)) − (x ⊕ y) = γ] > 0. We expect thatdblp:journals/iacr/SunHWWSMYF16 fatcat:7licbqo3snfsphh36jnqxepfpe