Generating preset distinguishing sequences using SAT

Official URL: http://dx.doi.org/10.1007/978-1-4471-2155-8_62

The preset distinguishing sequence generation problem is converted into a SAT problem to investigate the performance of SAT solvers for generating preset distinguishing sequences. An initial set of experiments are carried out and it is shown that the heuristics of SAT solvers can perform better than brute force algorithms that are used to generate preset distinguishing sequences.