Automated Cryptanalysis using ConstraintProgramming
Domain: Symmetric Cryptography, Constraint Programming (CP/SAT/ILP), Security Context & Objectives:
In the context of global encryption standardization (e.g., NIST calls), evaluating the security of block ciphers is critical. Recent advances have shifted manual cryptanalysis toward automated constraint models. However, current tools (like TAGADA or CLAASP) only solve isolated sub-problems, requiring manual complexity compilation. This PhD aims to unify these steps into a single framework to optimize global attack complexity directly and find finer security bounds on established or forthcoming ciphers. Core Research Axes: Fully Automated Differential Attacks: Merge separate attack phases into a single model using generic solvers to optimize global complexity instead of sub-problems.
Improving Truncated & Boomerang Attacks: Implement new constraint types directly into the core of CP solvers to improve abstraction quality and re...