Section: New Results

Using Constraint Programming to Solve a Cryptanalytic Problem

Participant : Marine Minier.

In [8], we described Constraint Programming (CP) models to solve a cryptanalytic problem: the related key differential attacks against the standard block cipher AES. We improved our models for those attacks and the time required to solve the related key differential attacks for all instances of this particular problem. In particular, we were able to find the best related key differential trails for all the instances of AES-128, AES-192 and AES-256 in less than 5 core-hours except for one instance (AES-128 with 5 rounds) that took 15 core-hours.