# Can the RSA accumulator scheme be converted to Elliptic Curve math?

Is it possible to translate the RSA accumulator scheme directly to EC without requiring bilinear pairings?

In RSA we have:

$$A_{n+1} = A_n^c$$ st. $$\{c \: \textrm{prime} \: | \: c \in [\mathcal{A}, \mathcal{B}]\}$$

$$W = A_n$$

$$A_{n+1} \stackrel{?}{=} W^c$$

Would this work in EC like this?

$$A_{n+1} = c A_n$$

$$W = A_n$$

$$A_{n+1} \stackrel{?}{=} c W$$

Where $$A_0$$ is a generator point on the curve and $$c$$ is prime.

If not, then why?