Abstract:
The report is supposed to consider the possibility of using binary decision diagrams (BDD) for the discrete function inversion in the parallel high-performance computing systems. We describe the architecture of a fundamentally new SAT-solver. The BDD-technology reducing the usage of memory which in turn keeps the search history lies in the basis of the solver. As testing problems we consider cryptanalysis of a number of key stream generators.