An new hybrid cryptosystem based on the satisfiability problem.
Sadek BouroubiLouiza RezkallahPublished in: Stud. Inform. Univ. (2011)
Keyphrases
- satisfiability problem
- np complete
- temporal logic
- search algorithm
- phase transition
- cellular automata
- sat problem
- stochastic local search
- stochastic local search algorithms
- pspace complete
- max sat
- mazurkiewicz traces
- solving hard
- elliptic curve
- sat instances
- dynamic programming
- weighted max sat
- public key cryptosystem
- decision procedures
- model checking
- orders of magnitude
- computational complexity