Pseudoprime Reductions of Elliptic Curves
2012 ◽
Vol 64
(1)
◽
pp. 81-101
◽
Keyword(s):
Abstract Let E be an elliptic curve over ℚ without complex multiplication, and for each prime p of good reduction, let nE(p) = |E(𝔽p)|. For any integer b, we consider elliptic pseudoprimes to the base b. More precisely, let QE,b(x) be the number of primes p ⩽ x such that bnE(p) ≡ b (mod nE(p)), and let πpseuE,b (x) be the number of compositive nE(p) such that bnE(p) ≡ b (mod nE(p)) (also called elliptic curve pseudoprimes). Motivated by cryptography applications, we address the problem of finding upper bounds for QE,b(x) and πpseuE,b (x), generalising some of the literature for the classical pseudoprimes to this new setting.
2005 ◽
Vol 48
(1)
◽
pp. 16-31
◽
Keyword(s):
Keyword(s):
2018 ◽
Vol 2020
(24)
◽
pp. 10005-10041
◽
Keyword(s):
2015 ◽
Vol 160
(1)
◽
pp. 167-189
◽
Keyword(s):
2012 ◽
Vol 92
(1)
◽
pp. 45-60
◽
Keyword(s):
2015 ◽
Vol 18
(1)
◽
pp. 308-322
◽