Choco-solver Page 1 HAL Id: hal-03932507 https://hal.science/hal-03932507 Submitted on 10
Jan 2023 HAL is a multi-disciplinary open access archive for the deposit and dissemination of …

In this paper, we introduce Constraint Programming (CP) models to solve a cryptanalytic
problem: the chosen key differential attack against the standard block cipher AES. The …

Ant colony optimization is a well established metaheuristic from the swarm intelligence field
for solving difficult optimization problems. In this work we present an application of ant …

The cube attack is a powerful cryptanalysis technique against symmetric primitives,
especially for stream ciphers. One of the key step in a cube attack is recovering the …

The concept of domain views is a powerful abstraction in constraint programming. It permits
to define variables that do not declare any domain but instead rely on a variable x and a …

The video games industry generates billions of dollars in sales every year. Video games can
offer increasingly complex gaming experiences, with gigantic (but consistent) open worlds …

Although graphs are widely used to encode and solve various computational problems, little
research exists on constrained graph construction. The current research was carried out to …

Cryptography is a critical science for our connected societies. It involves the design, analysis
and implementation of cipher algorithms. Analyzing ciphers is a mandatory step to ensure …

Since its appearance in discrete mathematics, graphs have gained increasing importance
due to their capacity to model and solve real-world computational problems. They even …

Résumé Le concept de vues de domaine est une abstraction puissante en programmation
par contraintes. Il permet de définir des variables qui ne déclarent aucun domaine, mais qui …