Given an elliptic curve E over a finite field F-q we study the finite extensions F(q)n of F-q such that the number of F(q)n-rational points on E attains the Hasse upper bound. We obtain an upper bound on the degree n for E ordinary using an estimate for linear forms in logarithms, which allows us to compute the pairs of isogeny classes of such curves and degree n for small q. Using a consequence of Schmidt's Subspace Theorem, we improve the upper bound to
We give a deterministic polynomial-time algorithm that computes a nontrivial rational point on an el...
We give a deterministic polynomial-time algorithm that computes a nontrivial rational point on an el...
We give a deterministic polynomial-time algorithm that computes a nontrivial rational point on an el...
Given an elliptic curve E over a finite field F-q we study the finite extensions F(q)n of F-q such t...
Given an elliptic curve E over a finite field F-q we study the finite extensions F(q)n of F-q such t...
The number N of rational points on an algebraic curve of genus g over a finite field bb F-q satisfie...
In 1924, Artin proposed an estimate for the number of points on an elliptic curve over the finite fi...
The Hasse estimate for the number M of points on an elliptic cubic curve over a finite field of q el...
The main goal of this thesis is the study of elliptic curves over finite fields and the number of po...
The main goal of this thesis is the study of elliptic curves over finite fields and the number of po...
We study the number of the rational points of elliptic curves defined over finite fields as polynomi...
The Hasse estimate for the number M of points on an elliptic cubic curve over a finite field of q el...
Given an elliptic curve E and a positive integer N, we consider the problem of counting the number o...
Minor revisionsFor a given genus $g \geq 1$, we give lower bounds for the maximal number of rational...
We present a lower bound for the exponent of the group of rational points of an elliptic curve over ...
We give a deterministic polynomial-time algorithm that computes a nontrivial rational point on an el...
We give a deterministic polynomial-time algorithm that computes a nontrivial rational point on an el...
We give a deterministic polynomial-time algorithm that computes a nontrivial rational point on an el...
Given an elliptic curve E over a finite field F-q we study the finite extensions F(q)n of F-q such t...
Given an elliptic curve E over a finite field F-q we study the finite extensions F(q)n of F-q such t...
The number N of rational points on an algebraic curve of genus g over a finite field bb F-q satisfie...
In 1924, Artin proposed an estimate for the number of points on an elliptic curve over the finite fi...
The Hasse estimate for the number M of points on an elliptic cubic curve over a finite field of q el...
The main goal of this thesis is the study of elliptic curves over finite fields and the number of po...
The main goal of this thesis is the study of elliptic curves over finite fields and the number of po...
We study the number of the rational points of elliptic curves defined over finite fields as polynomi...
The Hasse estimate for the number M of points on an elliptic cubic curve over a finite field of q el...
Given an elliptic curve E and a positive integer N, we consider the problem of counting the number o...
Minor revisionsFor a given genus $g \geq 1$, we give lower bounds for the maximal number of rational...
We present a lower bound for the exponent of the group of rational points of an elliptic curve over ...
We give a deterministic polynomial-time algorithm that computes a nontrivial rational point on an el...
We give a deterministic polynomial-time algorithm that computes a nontrivial rational point on an el...
We give a deterministic polynomial-time algorithm that computes a nontrivial rational point on an el...