# Known attacks against ECC in case many multiples are known?

Suppose there's a secret value x, an elliptic curve with the (public) generator G, and a sequence of secret values a1, a2, ..., an. The attacker knows the results of the following expressions: a1*x*G, a2*x*G, ..., an*x*G.

Is there any known weakness that'd allow the attacker to restore x based on this information? Maybe if n is becoming large enough (say, thousands/millions)? (To clarify: The attacker can not control the choice of a1...an.)

• What is the source of this question? Anybody can create these points even with the knowledge of $a_i$. So what is the point of making them secret? – kelalaka Dec 23 '20 at 0:16