Pseudoprime Reductions of Elliptic Curves
Résumé
Let E be an elliptic curve over Q without complex multiplication, and for each prime p of good reduction, let n E (p) = |E(F p)|. For any integer b, we are studying in this paper elliptic pseudoprimes to the base b. More precisely, let Q E,b (x) be the number of primes p x such that b n E (p) ≡ b (mod n E (p)), and π pseu E,b (x) be the number of compositive n E (p) such that b n E (p) ≡ b (mod n E (p)) (also called elliptic curve pseudoprimes). Motivated by cryptography applications, we address in this paper the problem of finding upper bounds for Q E,b (x) and π pseu E,b (x), generalising some of the literature for the classical pseudoprimes [6, 17] to this new setting.
Domaines
Théorie des nombres [math.NT]
Origine : Fichiers produits par l'(les) auteur(s)
Loading...