TweakAESKS

This repo contains the implementations used for the paper "Tweaking the AES Key-Schedule for Better Truncated Differential Bounds" by Patrick Derbez, Pierre-Alain Fouque, Jérémy Jean and Baptiste Lambin, accepted at SAC 2018 and available here.

Required :

• Minizinc
• Gecode
• Choco

The folder organization is the following :

• search_cycle contains the code used to prove Theorem 2 in Section 4.1
• meta_search contains the code for Algorithm 1 (Tweaked Simulated Annealing) in Section 4.2
• searchAllPathcontains the Minizinc model to search for all truncated paths of a given length (end of Section 4.2)
• search_instanciatecontains the Choco model to search for an instantiation with probability > 2^{-128}