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 …

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 …

Cryptographic hash functions play an essential role in various aspects of cryptography, such
as message authentication codes, pseudorandom number generation, digital signatures …

Propositional satisfiability solving (SAT) has been one of the most successful automated
reasoning methods in the last decade in computer science by solving a wide range of both …

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 …

Hardware acceleration circuits for cryptographic algorithms are largely deployed in a wide
range of products. The HW implementations of such algorithms often suffer from a number of …

Algebraic solving of polynomial systems and satisfiability of propositional logic formulas are
not two completely separate research areas, as it may appear at first sight. In fact, many …

Unit propagation is the hottest path in CDCL SAT solvers, therefore the related data-
structures, algorithms and implementation details are well studied and highly optimized …

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 …

SHA2 is widely used in various traditional public key ryptosystems, post-quantum
cryptography, personal identification, and network communication protocols. Therefore …