Elliptic divisibility sequences and the elliptic curve discrete logarithm problem

You are looking at a specific version 20081020:192618 of this paper. See the latest version.

Paper 2008/444

Elliptic divisibility sequences and the elliptic curve discrete logarithm problem

Rachel Shipsey and Christine Swart

Abstract

We use properties of the division polynomials of an elliptic curve $E$ over a finite field $\mathbb{F}_q$ together with a pure result about elliptic divisibility sequences from the 1940s to construct a very simple alternative to the Menezes-Okamoto-Vanstone algorithm for solving the elliptic curve discrete logarithm problem in the case where $\#E(\mathbb{F}_q) = q-1$.

Metadata

Available format(s): PDF PS
Category: Public-key cryptography
Publication info: Published elsewhere. Unknown where it was published
Keywords: elliptic divisibility sequences elliptic curve cryptography elliptic curve discrete log problem
Contact author(s): christine swart @ uct ac za
History: 2008-10-20: received
Short URL: https://ia.cr/2008/444
License: CC BY