Title :
An implementation of space-time tradeoff method for subset sum problem
Author :
Mine, Takumi ; Murakami, Yasuyuki
Author_Institution :
Osaka Electro-Commun. Univ., Neyagawa, Japan
fDate :
Nov. 29 2011-Dec. 1 2011
Abstract :
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.
Keywords :
knapsack problems; optimisation; public key cryptography; NP-complete problems; SSP; execution time; increased memory use; knapsack public-key cryptosystem; space-time tradeoff method; subset sum problem; Computer science; Computers; Public key cryptography; Quantum computing; Search methods; Time measurement; knapsack public-key cryptosystem; space-time tradeoff method; the subset sum problem;
Conference_Titel :
Computer Sciences and Convergence Information Technology (ICCIT), 2011 6th International Conference on
Conference_Location :
Seogwipo
Print_ISBN :
978-1-4577-0472-7
