Extension of the Toolkit for Counting Active S-boxes using Mixed-Integer Linear Programming (MILP)
- Author: Laura Winnen
- Download: http://www.ecrypt.eu.org/tools/uploads/sage_sbox_milp.zip
This toolkit can be used to prove the security of cryptographic ciphers against linear and differential cryptanalysis. The toolkit generates a Mixed-Integer Linear Programming problem which counts the minimum number of (linearly or differentially) active S-boxes for a given cipher and solves this using a MILP solver in Sage.
The toolkit includes the implementation in Sage for AES, small AES, Present, Led, mCrypton, Klein and Enocoro.