Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

ANTS
2006
Springer

favoriteEmaildiscussreport

118views Algorithms» more ANTS 2006»

Construction of Rational Points on Elliptic Curves over Finite Fields

13 years 6 months ago

Construction of Rational Points on Elliptic Curves over Finite Fields

Download www.math.leidenuniv.nl

Abstract. We give a deterministic polynomial-time algorithm that computes a nontrivial rational point on an elliptic curve over a finite field, given a Weierstrass equation for the curve. For this, we reduce the problem to the task of finding a rational point on a curve of genus zero.

Andrew Shallue, Christiaan van de Woestijne

Real-time Traffic

Algorithms | ANTS 2006 | Deterministic Polynomial-time Algorithm | Nontrivial Rational Point | Rational Point |

claim paper

Related Content

» Weil Descent of Elliptic Curves over Finite Fields of Characteristic Three

» Partial Lifting and the Elliptic Curve Discrete Logarithm Problem

» Tables of curves with many points

» Two Efficient Algorithms for Arithmetic of Elliptic Curves Using Frobenius Map

» Zeta functions of equivalence relations over finite fields

» Elliptic Curves with Low Embedding Degree

» Lifting Elliptic Curves and Solving the Elliptic Curve Discrete Logarithm Problem

» Primality Proving Using Elliptic Curves An Update

» Selecting Cryptographic Key Sizes

Post Info
More Details (n/a)

Added	13 Oct 2010
Updated	13 Oct 2010
Type	Conference
Year	2006
Where	ANTS
Authors	Andrew Shallue, Christiaan van de Woestijne

Comments (0)