22 search results - page 1 / 5 » Construction of Rational Points on Elliptic Curves over Fini... |
84
Voted
ANTS
2006
Springer
14 years 11 months ago
2006
Springer
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...
ASIACRYPT
2000
Springer
15 years 1 months ago
2000
Springer
The paper shows that some of elliptic curves over finite fields of characteristic three of composite degree are attacked by a more effective algorithm than Pollard’s ρ method...
76
Voted
ALGORITHMICA
2006
14 years 9 months ago
2006
It has been suggested that a major obstacle in finding an index calculus attack on the elliptic curve discrete logarithm problem lies in the difficulty of lifting points from ellip...
MOC
2000
14 years 9 months ago
2000
These tables record results on curves with many points over finite fields. For relatively small genus (0 g 50) and q a small power of 2 or 3 we give in two tables the best presen...
PKC
1998
Springer
15 years 1 months ago
1998
Springer
In this paper, we present two efficient algorithms computing scalar multiplications of a point in an elliptic curve defined over a small finite field, the Frobenius map of which ha...