200 citations · 333 across the 5 of their papers we have counts for
Showing 2004 · math.NTShow all
2 papers · 2 filters
math.NT2004★ 50 cited
Do All Elliptic Curves of the Same Order Have the Same Difficulty of Discrete Log?
David Jao, Stephen D. Miller, Ramarathnam Venkatesan
The aim of this paper is to justify the common cryptographic practice of selecting elliptic curves using their order as the primary criterion. We can formalize this issue by asking…
math.NT2004★ 3 cited
Supersingular primes for points on
David Jao
For small odd primes , we prove that most of the rational points on the modular curve parametrize pairs of elliptic curves having infinitely many supersingular prim…