Sage S-box MILP toolkit
Sage S-box MILP toolkit: Extension of the Toolkit for Counting Active S-boxes using Mixed-Integer Linear Programming (MILP). 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.
Keywords for this software
References in zbMATH (referenced in 2 articles )
Showing results 1 to 2 of 2.
- Li, Yanbin; Wang, Meiqin: Cryptanalysis of MORUS (2019)
- Fu, Kai; Wang, Meiqin; Guo, Yinghua; Sun, Siwei; Hu, Lei: MILP-based automatic search algorithms for differential and linear trails for Speck (2016)