A New Algorithm to Provide all Solutions of SSP Problem

Sum of subset (SSP) is an important problem of complexity theory and cryptography in computer science. The SSP involves searching from a given set of distinct integers to find all the subsets whose sum of elements equal to certain integer capacity. The importance of this algorithm is that, it can be applied to create a better decryption technique and in many others. The proposed algorithm is able to find all solutions of SSP from a given set of integers. Simulation shows that the algorithm takes less number of steps as compared to traditional back tracking algorithm. General Terms NP hard, NP complete, cryptography, encryption, decryption.