Subset sum, a new insight

Samir Bouftass

Paper 2025/108

Subset sum, a new insight

Samir Bouftass

Abstract

In this paper, we show that subset sum problem consists on finding a solution over $N_{2}$ of equation $n = A X ∙ U$ where A and n are given matrix and integer and U = $[(2^{0}) (2^{1}) . . . . (2^{d - 2}) (2^{d - 1})]$ . We show that it can be subdivized into 2 solvable subproblems.

Metadata

Available format(s): PDF
Category: Foundations
Publication info: Preprint.
Keywords: Subset sum problem Complexity Polynomial time
Contact author(s): crypticator @ gmail com
History: 2025-01-24: approved; 2025-01-23: received; See all versions
Short URL: https://ia.cr/2025/108
License: CC BY

BibTeX

@misc{cryptoeprint:2025/108,
      author = {Samir Bouftass},
      title = {Subset sum, a new insight},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/108},
      year = {2025},
      url = {https://eprint.iacr.org/2025/108}
}