Let $E$ be an elliptic curve over $\mathbb Q$ without complex multiplication, and for each prime $p$ of good reduction, let $n_E(p) = | E(\mathbb F_p) |$. For any integer $b$, we consider elliptic pseudoprimes to the base $b$. More precisely, let $Q_{E,b}(x)$ be the number of primes $p \leq x$ such that $b^{n_E(p)} \equiv b\,({\rm mod}\,n_E(p))$, and let $\pi_{E, b}^{\operatorname{pseu}}(x)$ be the number of compositive $n_E(p)$ such that $b^{n_E(p)} \equiv b\,({\rm mod}\,n_E(p))$ (also called elliptic curve pseudoprimes). Motivated by cryptography applications, we address the problem of finding upper bounds for $Q_{E,b}(x)$ and $\pi_{E, b}^{\operatorname{pseu}}(x)$, generalising some of the literature for the classical pseudoprimes to this new setting.

For a given elliptic curve $\E$, we obtain an upper bound on the discrepancy of sets of multiples $z_sG$ where $z_s$ runs through a sequence $\cZ=\(z_1, \dots, z_T\)$ such that $k z_1,\dots, kz_T $ is a permutation of $z_1, \dots, z_T$, both sequences taken modulo $t$, for sufficiently many distinct values of $k$ modulo $t$. We apply this result to studying an analogue of the power generator over an elliptic curve. These results are elliptic curve analogues of those obtained for multiplicative groups of finite fields and residue rings.

Let $E$ be an elliptic curve over $\q$, and let $r$ be an integer. According to the Lang-Trotter conjecture, the number of primes $p$ such that $a_p(E) = r$ is either finite, or is asymptotic to $C_{E,r} {\sqrt{x}} / {\log{x}}$ where $C_{E,r}$ is a non-zero constant. A typical example of the former is the case of rational $\ell$-torsion, where $a_p(E) = r$ is impossible if $r \equiv 1 \pmod{\ell}$. We prove in this paper that, when $E$ has a rational $\ell$-isogeny and $\ell \neq 11$, the number of primes $p$ such that $a_p(E) \equiv r \pmod{\ell}$ is finite (for some $r$ modulo $\ell$) if and only if $E$ has rational $\ell$-torsion over the cyclotomic field $\q(\zeta_\ell)$. The case $\ell=11$ is special, and is also treated in the paper. We also classify all those occurences.