Two deterministic algorithms are proposed for the (n,k)-complete hidden subset sum problem, including a symmetric-polynomial method with complexity O(sum p(u,<=k)^3 + binom(n,k)n) under non-singularity conditions.
Speeding up discrete log and factoring based schemes via precomputat ions
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.CO 1years
2024 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem
Two deterministic algorithms are proposed for the (n,k)-complete hidden subset sum problem, including a symmetric-polynomial method with complexity O(sum p(u,<=k)^3 + binom(n,k)n) under non-singularity conditions.