Sciweavers

129 search results - page 6 / 26
» Logical Cryptanalysis as a SAT Problem
Sort
View
AI
2004
Springer
14 years 9 months ago
ASSAT: computing answer sets of a logic program by SAT solvers
We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a normal logic program, we show that by addin...
Fangzhen Lin, Yuting Zhao
CORR
2010
Springer
97views Education» more  CORR 2010»
14 years 9 months ago
Cryptanalysis of an Efficient Signcryption Scheme with Forward Secrecy Based on Elliptic Curve
The signcryption is a relatively new cryptographic technique that is supposed to fulfill the functionalities of encryption and digital signature in a single logical step. Several ...
Mohsen Toorani, Ali Asghar Beheshti Shirazi
CORR
2010
Springer
135views Education» more  CORR 2010»
14 years 9 months ago
Cryptanalysis of an Elliptic Curve-based Signcryption Scheme
The signcryption is a relatively new cryptographic technique that is supposed to fulfill the functionalities of encryption and digital signature in a single logical step. Although...
Mohsen Toorani, Ali Asghar Beheshti Shirazi
IPPS
1999
IEEE
15 years 1 months ago
Solving Satisfiability Problems on FPGAs using Experimental Unit Propagation Heuristic
This paperpresents new resultson anapproach for solvingsatisfiability problems (SAT), that is, creating a logic circuit that is specialized to solve each problem instance on Field ...
Takayuki Suyama, Makoto Yokoo, Akira Nagoya
JAR
2007
132views more  JAR 2007»
14 years 9 months ago
Visualizing SAT Instances and Runs of the DPLL Algorithm
SAT-solvers have turned into essential tools in many areas of applied logic like, for example, hardware verification or satisfiability checking modulo theories (SMT). And althoug...
Carsten Sinz