129 search results - page 23 / 26 » Logical Cryptanalysis as a SAT Problem |
FCS
2006
13 years 11 months ago
2006
- There is continuing research interest in comparison of the complexity of problems within the class NP-Complete. This paper examines the representational power of conjunctive norm...
IJISEC
2008
13 years 9 months ago
2008
We present a model checking technique for security protocols based on a reduction to propositional logic. At the core of our approach is a procedure that, given a description of th...
ENTCS
2007
13 years 9 months ago
2007
Bounded Model Checking (BMC) is a successful refutation method to detect errors in not only circuits and other binary systems but also in systems with more complex domains like ti...
IJCAI
2007
13 years 11 months ago
2007
In this paper we present a general logical framework for (weighted) MAX-SAT problem, and study properties of inference rules for branch and bound MAX-SAT solver. Several rules, wh...
GLVLSI
2007
IEEE
14 years 4 months ago
2007
IEEE
Compact realizations of reversible logic functions are of interest in the design of quantum computers. Such reversible functions are realized as a cascade of Toffoli gates. In th...