activity
20072026
most citedAmicable pairs and aliquot cycles for elliptic curves

33 citations · 218 across the 26 of their papers we have counts for

collaborators
Showing 2008 · math.NTShow all

1 paper · 2 filters

math.NT2008★ 31 cited

The elliptic curve discrete logarithm problem and equivalent hard problems for elliptic divisibility sequences

Kristin E. Lauter, Katherine E. Stange

We define three hard problems in the theory of elliptic divisibility sequences (EDS Association, EDS Residue and EDS Discrete Log), each of which is solvable in sub-exponential tim…