Displaying 781 – 800 of 902

Showing per page

Counting points on elliptic curves over finite fields

René Schoof (1995)

Journal de théorie des nombres de Bordeaux

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 polynomial...

Counting rational points near planar curves

Ayla Gafni (2014)

Acta Arithmetica

We find an asymptotic formula for the number of rational points near planar curves. More precisely, if f:ℝ → ℝ is a sufficiently smooth function defined on the interval [η,ξ], then the number of rational points with denominator no larger than Q that lie within a δ-neighborhood of the graph of f is shown to be asymptotically equivalent to (ξ-η)δQ².

Currently displaying 781 – 800 of 902