129 search results - page 1 / 26 » Logical Cryptanalysis as a SAT Problem |
JAR
2000
13 years 4 months ago
2000
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 seld...
FROCOS
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. 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 reducin...
TABLEAUX
1999
Springer
13 years 9 months ago
1999
Springer
In this paper we present the results of applying HAM-ALC, a description logic system for ALCNR, to modal logic SAT problems.
SAT
2004
Springer
13 years 10 months ago
2004
Springer
The finite model generation problem in the first-order logic is a generalization of the propositional satisfiability (SAT) problem. An essential algorithm for solving the proble...
SAT
2007
Springer
13 years 11 months ago
2007
Springer
SAT solvers are often challenged with very hard problems that remain unsolved after hours of CPU time. The research community meets the challenge in two ways: (1) by improving the ...