ML Anthology

Using Constraint Programming to Solve a Cryptanalytic Problem

David Gérault, Marine Minier, Christine Solnon
IJCAI 2017 pp. 4844-4848
doi:10.24963/IJCAI.2017/679 /ijcai/2017/gerault2017ijcai-using/

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 cryptanalysis tools, and we prove that a solution claimed to be optimal in two recent cryptanalysis papers is not optimal by providing a better solution.

PDF IJCAI Semantic Scholar

Cite

Text

Gérault et al. "Using Constraint Programming to Solve a Cryptanalytic Problem." International Joint Conference on Artificial Intelligence, 2017. doi:10.24963/IJCAI.2017/679

Markdown

[Gérault et al. "Using Constraint Programming to Solve a Cryptanalytic Problem." International Joint Conference on Artificial Intelligence, 2017.](https://mlanthology.org/ijcai/2017/gerault2017ijcai-using/) doi:10.24963/IJCAI.2017/679

BibTeX

@inproceedings{gerault2017ijcai-using,
  title     = {{Using Constraint Programming to Solve a Cryptanalytic Problem}},
  author    = {Gérault, David and Minier, Marine and Solnon, Christine},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2017},
  pages     = {4844-4848},
  doi       = {10.24963/IJCAI.2017/679},
  url       = {https://mlanthology.org/ijcai/2017/gerault2017ijcai-using/}
}