T H E A B S T R A C T

P Vs NP problem is an open problem in the theory of optimization and asks whether two of the important complexity classes, P and NP are same.

The P Vs NP problem directly affects one of the most basic things of our modern day survival, the Internet security. This classic problem in theoretical computer science was formulated by Stephen Cook in 1971.

The  RSA  ciphering-deciphering  technology  or  public  key  cryptography  has  seeds  of  its success, in assumption of the fact that P is not equal to NP. If we assume truth of this paper’s result then newer methods have to be searched for coding public keys, and that is surely an interesting task as if now we have supposed to reach a stagnation point.

The mathematical gain of supposed truth of this result is that it opens a search for solution of the 3000 plus NP complete problems and much more.