Over the years, many automated methods have been proposed to help designers and cryptanalysts prove security bounds of symmetric-key primitives against various attacks such as differential or integral cryptanalysis. These include the use of mixed integer linear programming (MILP), Boolean satisfiability problem (SAT) solvers and their extension, satisfiability modulo theories (SMT) solvers, as well as constraint programming (CP) solvers. More recently, data-driven techniques that rely on machine and deep learning have also been proposed, leading to attacks that rival that of their classical counterparts.
The aim of the ADSC workshop is to provide an international forum for researchers to explore and further push the boundaries of these automated and data-driven methods. We welcome submissions on the application, improvement and efficient implementation of these methods. We solicit submissions of original research papers related to automated and data-driven cryptanalysis methods, including (but not limited to):
- New cryptanalysis results of symmetric-key primitives and cryptosystems based on these methods.
- Comments on the mathematical, algorithmic and practical aspects of these automated/data-driven methods.
- Performance, efficient implementations or other related improvements.
- Comparison and benchmarks of concrete tools (SAT/SMT/CP solvers, MILP optimizers, learning frameworks) with regards to their suitability and efficiency for symmetric-key cryptanalysis.
There is a best ACNS workshop paper award (with 500 EUR prize sponsored by Springer), to be selected from the accepted papers of all workshops.
Note that the scope of this workshop does not cover attacks against cryptographic implementations or hardware. These papers are better suited for other ACNS workshops.
If there are any questions, please contact us at email@example.com