Displaying similar documents to “On Elkies subgroups of -torsion points in elliptic curves defined over a finite field”

S -integral points on elliptic curves - Notes on a paper of B. M. M. de Weger

Emanuel Herrmann, Attila Pethö (2001)

Journal de théorie des nombres de Bordeaux

Similarity:

In this paper we give a much shorter proof for a result of B.M.M de Weger. For this purpose we use the theory of linear forms in complex and p -adic elliptic logarithms. To obtain an upper bound for these linear forms we compare the results of Hajdu and Herendi and Rémond and Urfels.

Counting points on elliptic curves over finite fields

René Schoof (1995)

Journal de théorie des nombres de Bordeaux

Similarity:

We describe three algorithms to count the number of points on an elliptic curve over a finite field. The first one is very practical when the finite field is not too large ; it is based on Shanks's baby-step-giant-step strategy. The second algorithm is very efficient when the endomorphism ring of the curve is known. It exploits the natural lattice structure of this ring. The third algorithm is based on calculations with the torsion points of the elliptic curve [18]. This deterministic...

Computing modular degrees using L -functions

Christophe Delaunay (2003)

Journal de théorie des nombres de Bordeaux

Similarity:

We give an algorithm to compute the modular degree of an elliptic curve defined over . Our method is based on the computation of the special value at s = 2 of the symmetric square of the L -function attached to the elliptic curve. This method is quite efficient and easy to implement.

A note on integral points on elliptic curves

Mark Watkins (2006)

Journal de Théorie des Nombres de Bordeaux

Similarity:

We investigate a problem considered by Zagier and Elkies, of finding large integral points on elliptic curves. By writing down a generic polynomial solution and equating coefficients, we are led to suspect four extremal cases that still might have nondegenerate solutions. Each of these cases gives rise to a polynomial system of equations, the first being solved by Elkies in 1988 using the resultant methods of , with there being a unique rational nondegenerate solution. For the second...

A fast algorithm for polynomial factorization over p

David Ford, Sebastian Pauli, Xavier-François Roblot (2002)

Journal de théorie des nombres de Bordeaux

Similarity:

We present an algorithm that returns a proper factor of a polynomial Φ ( x ) over the p -adic integers p (if Φ ( x ) is reducible over p ) or returns a power basis of the ring of integers of p [ x ] / Φ ( x ) p [ x ] (if Φ ( x ) is irreducible over p ). Our algorithm is based on the Round Four maximal order algorithm. Experimental results show that the new algorithm is considerably faster than the Round Four algorithm.