ECFP harder than ECDLP? Given two points $P$ and $Q = \sum_{i=1}^{n} x_i.P$ over $E_p(a, b)$ for $x_1,x_2,...,x_n \in \mathbb F_p$. The Elliptic Curve Factorization Problem (ECFP) is to find the points $x_1.P,x_2.P,...,x_n.P$

Is ECFP harder than ECDLP ? Can anyone provide me the proof ?
It's not harder.


Solve the DL problem to get $x$ in $Q=x.P$.
$Q = \sum_{i=1}^{n} x_i.P = (\sum_{i=1}^{n} x_i).P= x.P$


=> any set of $x_i$ that sums to $x$ (modulo the group order) is a solution to ECFP.