Polynomial solvability of satisfiability and its implication to hybrid cryptosystem security

In this paper we propose a methodology for breaking the hybrid cryptosystem based on satisfiability problem. The hybrid cryptosystem use 3SAT, the NP Complete approach to perform the task of encryption. In this paper using the well formed computational result showing the solvability of 3SAT in polynomial time, we illustrate the security threats existing on such cryptosystem.