Skip to Main content Skip to Navigation
Conference papers

Using Constraint Programming to solve a Cryptanalytic Problem

David Gerault 1 Marine Minier 2 Christine Solnon 3
2 CARAMBA - Cryptology, arithmetic : algebraic methods for better algorithms
LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry, Inria Nancy - Grand Est
3 M2DisCo - Geometry Processing and Constrained Optimization
LIRIS - Laboratoire d'InfoRmatique en Image et Systèmes d'information
Abstract : We describe Constraint Programming (CP) models to solve a cryptanalytic problem: the chosen key differential attack against the standard block cipher AES. We show that CP solvers are able to solve these problems quicker than dedicated cryptanaly-sis tools, and we prove that a solution claimed to be optimal in two recent cryptanalysis papers is not optimal by providing a better solution.
Complete list of metadatas

Cited literature [8 references]  Display  Hide  Download
Contributor : Christine Solnon <>
Submitted on : Sunday, May 28, 2017 - 3:26:15 PM
Last modification on : Thursday, November 21, 2019 - 2:37:46 AM
Document(s) archivé(s) le : Wednesday, September 6, 2017 - 10:33:28 AM


Files produced by the author(s)


  • HAL Id : hal-01528272, version 1


David Gerault, Marine Minier, Christine Solnon. Using Constraint Programming to solve a Cryptanalytic Problem. IJCAI 2017 - International Joint Conference on Artificial Intelligence (Sister Conference Best Paper Track), Aug 2017, Melbourne, Australia. pp.4844-4848. ⟨hal-01528272⟩



Record views


Files downloads