Conferences  >  Mathematics  >  Automated Theorem Proving  >  Japan

in conjunction with ACNS 2023

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.