Comment Don't even try!!! (Score -1) 276
Many, if not all, encryption algorithms is based upon the fact that the set of non-deterministic polynomial decision problems is not equivalent to the set of decision problems that is decidable in polynomial time.
If you want to get rich, solve P=NP and then you'll be able to crack every banking account in the world.
If you want to get rich, solve P=NP and then you'll be able to crack every banking account in the world.
