Paper 2011/525 Original: eprint.iacr.org/2011/525 ↗
A Note on the Density of the Multiple Subset Sum Problems
Abstract
It is well known that the general subset sum problem is NP-complete. However, almost all subset sum problems with density less than $0.9408\ldots$ can be solved in polynomial time with an oracle that can find the shortest vector in a special lattice. In this paper, we give a similar result for the multiple subset sum problems which has $k$ subset sum problems with the same solution. Some extended versions of the multiple subset sum problems are also considered. In addition, a modified lattice is involved to make the analysis much simpler than before.
Metadata
- Available format(s)
PDF- Publication info
- Preprint.
- History
- 2011-10-18: last updated
- 2011-09-26: published
- Short URL
- https://ia.cr/2011/525
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2011/525,
author = {Yanbin Pan and Feng Zhang},
title = {A Note on the Density of the Multiple Subset Sum Problems},
howpublished = {Cryptology {ePrint} Archive, Paper 2011/525},
year = {2011},
url = {https://eprint.iacr.org/2011/525}
}