Welcome to the resource topic for 2025/108
Title:
Subset sum, a new insight
Authors: Samir Bouftass
Abstract:In this paper, we show that subset sum problem consists on finding a solution over \mathbb{N}_2 of equation n = \textbf{A}X \bullet 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.
ePrint: https://eprint.iacr.org/2025/108
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .