Supervised learning can improve the design of state-of-the-art solvers for combinatorial
problems, but labelling large numbers of combinatorial instances is often impractical due to …

Cryptographic hash functions play a crucial role in ensuring data security, generating fixed-
length hashes from variable-length inputs. The hash function SHA-256 is trusted for data …

We present algorithms based on satisfiability problem (SAT) solving, as well as answer set
programming (ASP), for solving the problem of determining inconsistency degrees in …

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 …

In this paper, we present a machine learning based splitting heuristic for divide-and-conquer
parallel Boolean SAT solvers. Splitting heuristics, whether they are look-ahead or look-back …

Cryptographic problems, operating within binary variable spaces, can be routinely
transformed into Boolean Satisfiability (SAT) problems regarding specific cryptographic …

Comparing the performance of two configurations of a given algorithm plays a critical role in
algorithm configuration and performance optimisation, be it automated or manual, and …

MD5 and SHA-1 are fundamental cryptographic hash functions proposed in 1990s. Given a
message of arbitrary finite size, MD5 produces a 128-bit hash in 64 steps, while SHA-1 …

Over the last two decades, we have seen a dramatic improvement in the efficiency of conflict-
driven clause-learning Boolean satisfiability (CDCL SAT) solvers over industrial problems …

Recent advances in the field of machine learning have once again raised the question
whether computers can be trained to perform cryptanalytic tasks. In this paper, we identify …