In this paper we report on a novel approach for uniform encoding of hash functions (but also
other cryptographic functions) into propositional logic formulae, and reducing cryptanalysis …

Several standard cryptographic hash functions were broken in 2005. Some essential
building blocks of these attacks lend themselves well to automation by encoding them as …

In recent years, studies about the SATisfiability Problem (short for SAT) were more and more
numerous because of its conceptual simplicity and ability to express a large set of various …

The SATisfiability Problem is a core problem in mathematical logic and computing theory. In
the last years, progresses have led it to be a great and competitive approach to practically …

Cryptography ensures the confidentiality and authenticity of information but often relies on
unproven assumptions. SAT solvers are a powerful tool to test the hardness of certain …

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

This paper investigates the power of SAT solvers in cryptanalysis. The contributions are two-
fold and are relevant to both theory and practice. First, we introduce an efficient, generic and …

Inverting a function f at a given point y in its range involves finding any x in the domain such
that f (x)= y. This is a general problem. We wish to find a heuristic for inverting those …

In the present paper, we propose a technology for translating algorithmic descriptions of
discrete functions to SAT. The proposed technology is aimed at applications in algebraic …

Cryptographic algorithms play a key role in computer security and the formal analysis of their
robustness is of utmost importance. Yet, logic and automated reasoning tools are seldom …