In 1948, Ward defined elliptic divisibility sequences satisfying a certain recurrence relation. An elliptic divisibility sequence arises from any choice of elliptic curve and initial point on that curve. In this paper, we define a hard problem in the theory of elliptic divisibility sequences (EDS-DH problem), which is computationally equivalent to the elliptic curve Diffie-Hellman problem.
