Solving a Symmetric Key Cryptographic Problemwith Constraint Programming

Marine Minier 1 Christine Solnon 2 Julia Reboul 2
1 PRIVATICS - Privacy Models, Architectures and Tools for the Information Society
Inria Grenoble - Rhône-Alpes, CITI - CITI Centre of Innovation in Telecommunications and Integration of services
2 M2DisCo - Geometry Processing and Constrained Optimization
LIRIS - Laboratoire d'InfoRmatique en Image et Systèmes d'information
Abstract : This paper tries to sum up a starting work at the edge between Cryptography and Constraint Programming. Indeed, many cryptographic problems are solved using Branch \& Bound approaches which are implemented from scratch using classical programming languages such as C. This implies quite a lot of programming work. Furthermore, these problems are NP-hard and solving them within a reasonable amount of time is still challenging.The main goal of this paper is to investigate the capabilities of classical Constraint Programming tools for solving these problems. In this very first study, we focus on a particular problem coming from the symmetric key cryptography world. This particular problem could help cryptographers to mount attacks called differential attacks against block ciphers. Branch \& Bound approaches are not able to solve it within a reasonable amount of time. We introduce a CP model for this problem, and we show that Choco is able to solve it to optimality in less than two hours.
Type de document :
Autre publication
ModRef 2014, Workshop of the CP 2014 Conference, September 2014, Lyon, France. 2014, pp.13
Liste complète des métadonnées

https://hal.inria.fr/hal-01092574
Contributeur : Marine Minier <>
Soumis le : mardi 9 décembre 2014 - 08:43:56
Dernière modification le : jeudi 19 avril 2018 - 14:38:03

Identifiants

  • HAL Id : hal-01092574, version 1

Citation

Marine Minier, Christine Solnon, Julia Reboul. Solving a Symmetric Key Cryptographic Problemwith Constraint Programming. ModRef 2014, Workshop of the CP 2014 Conference, September 2014, Lyon, France. 2014, pp.13. 〈hal-01092574〉

Partager

Métriques

Consultations de la notice

427