An implementation of space-time tradeoff method for subset sum problem

The subset sum problem(SSP) is known to be one of the NP-complete problems. The knapsack public-key cryptosystem is based on SSP. In computer science, a space-time tradeoff method is well-known technique where the computation time can be reduced at the cost of increased memory use. It is known that the space-time tradeoff method can be applied to solve SSP. In this paper, we implement the space-time tradeoff method in order to solve SSP. Moreover, we measure execution time for solving SSP.