Abstract: In this paper, security mechanism called zero knowledge proofs has been defined using subset sum problem. We have used subset sum problem for robustness analysis of zero-knowledge proofs ...
Let S(A) represent the sum of elements in set A of size n. We shall call it a special sum set if for any two non-empty disjoint subsets, B and C, the following properties are true: S(B) ≠ S(C); that ...
./install/bin/subsetsumsolver --verbosity-level 1 --input data/pthree/pthree_1000_1 --algorithm dynamic-programming-bellman-word-ram-rec ===== KnapsackSolver ...
Abstract: The Subset-Sum Problem (SSP) ensures a significant role in various practical applications, which include cryptography and coding theory owing to the importance in the functionality of some ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback