SAT solving in large distributed environments has previously led to some famous results and
to impressive speedups for selected inputs. However, in terms of general-purpose SAT …

MD4 and MD5 are fundamental cryptographic hash functions proposed in the early 1990s.
MD4 consists of 48 steps and produces a 128-bit hash given a message of arbitrary finite …

As low-latency designs tend to have a small number of rounds to decrease latency, the
differential-type cryptanalysis can become a significant threat to them. In particular, since a …

SAT solvers are indispensable in formal verification for hardware and software with many
important applications. CDCL is the most widely used framework for modern SAT solvers …

In the context of parallel SAT solving, efficient information sharing plays a pivotal role in
improving the performance. Traditionally, this information comprises the clauses learned by …

Cette thèse présente des contributions multiples et orthogonales à l'amélioration de la
résolution parallèle du problème de satisfiabilité booléenne (ou problème SAT). Une …

In this paper, we present a Bayesian Moment Matching (BMM) in-processing technique for
Conflict-Driven Clause-Learning (CDCL) SAT solvers. BMM is a probabilistic algorithm …

In this paper, we present a Bayesian Moment Matching (BMM) in-processing technique for
Conflict-Driven Clause-Learning (CDCL) SAT solvers. BMM is a probabilistic algorithm …

This paper describes the solver PainlessAR submitted to the cloud track of the SAT
Competition 2024; The solver runs a version of the Painless solver on each node and uses …

ITMO-ParSAT, the parallel solver utilizing probabilistic backdoors at the SAT Competition 2022
Page 45 ITMO-ParSAT, the parallel solver utilizing probabilistic backdoors at the SAT …