Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

Given two elliptic curves, each of which is associated with a projection map that identifies opposite elements with respect to… Expand

Is this relevant?

2015

2015

Scalar multiplication is the most important and expensive operation in elliptic curve cryptosystems. In this study, the authors… Expand

Is this relevant?

2013

2013

Starting from the classical division polynomials we construct homogeneous polynomials $\alpha_n$, $\beta_n$, $\gamma_n$ such that… Expand

Is this relevant?

2012

2012

On the Analogue of the Division Polynomials for Hyperelliptic Curves

Is this relevant?

2011

2011

This paper presents two kinds of division polynomials for twisted Edwards curves. Their chief property is that they characterise… Expand

Is this relevant?

2011

2011

We generalize the division polynomials of elliptic curves to hyperelliptic Jacobians over the complex numbers. We construct them… Expand

Is this relevant?

2006

2006

In this report I sanitise (in the sense of ‘bring some sanity to’) the arguments of earlier reports detailing the correspondence… Expand

Is this relevant?

2004

2004

The choice of an elliptic curve for the implementation of an elliptic curve cryp- tosystem requires counting the number of points… Expand

Is this relevant?

2004

2004

Let $E$ be an elliptic curve with complex multiplication by the ring $O_{F}$ of integers of an imaginary quadratic field $F$. We… Expand

Is this relevant?

1994

1994

Recurrence relations for the coefficients of the nth division polynomial for elliptic curves are presented. These provide an… Expand

Is this relevant?