Related papers: Character sums determined by low degree isogenies …

A classical result of Dirichlet shows that certain elementary character sums compute class numbers of quadratic imaginary number fields. We obtain analogous relations between class numbers and a weighted character sum associated to a…

We prove two theorems concerning isogenies of elliptic curves over function fields. The first one describes the variation of the height of the $j$-invariant in an isogeny class. The second one is an "isogeny estimate", providing an explicit…

We propose an algorithm that calculates isogenies between elliptic curves defined over an extension $K$ of $\mathbb{Q}_2$. It consists in efficiently solving with a logarithmic loss of $2$-adic precision the first order differential…

We show that a character sum attached to a family of 3-isogenies defined on the fibers of a certain elliptic surface over $\mathbb{F}_p$ relates to the class number of the quadratic imaginary number field $\Q(\sqrt{-p})$. In this sense,…

We determine the possible degrees of cyclic isogenies defined over quadratic fields for non-CM elliptic curves with rational $j$-invariant.

We present some results on character degree sums in connection with certain characteristics of finite groups such as p-solvability, solvability, supersolvability, and nilpotency. Some of them strengthen known results in the literature.

We introduce an analogue of the Mertens conjecture for elliptic curves over finite fields. Using a result of Waterhouse, we classify the isogeny classes of elliptic curves for which this conjecture holds in terms the size of the finite…

We show that every elliptic curve over a finite field of odd characteristic whose number of rational points is divisible by 4 is isogenous to an elliptic curve in Legendre form, with the sole exception of a minimal respectively maximal…

An isogeny class of elliptic curves over a finite field is determined by a quadratic Weil polynomial. Gekeler has given a product formula, in terms of congruence considerations involving that polynomial, for the size of such an isogeny…

We count by height the number of elliptic curves over the rationals that possess an isogeny of degree three.

This article deals with the Galois representation attached to elliptic curves with an isogeny of prime degree over a number field. We first determine uniform criteria for the irreducibility of Galois representations attached to elliptic…

We determine all possible degrees of cyclic isogenies of non-CM elliptic curves with rational $j$-invariant over number fields of degree $p$, where $p$ is an odd prime. The question had been answered for $p=2$, so this paper completes the…

I prove lower bounds of some parameters of elliptic curve over finite field. There parameters are closely interrelated with cryptographic stability of elliptic curve.

We survey algorithms for computing isogenies between elliptic curves defined over a field of characteristic either 0 or a large prime. We introduce a new algorithm that computes an isogeny of degree $\ell$ ($\ell$ different from the…

We obtain explicit formulas for the number of non-isomorphic elliptic curves with a given group structure (considered as an abstract abelian group). Moreover, we give explicit formulas for the number of distinct group structures of all…

Building on Mazur's 1978 work on prime degree isogenies, Kenku determined in 1981 all possible cyclic isogenies of elliptic curves over $\mathbb{Q}$. Although more than 40 years have passed, the determination of cyclic isogenies of elliptic…

In this paper we determine automorphism groups of cyclic algebraic curves defined over finite fields of any characteristic.

We count by height the number of elliptic curves over the rationals, both up to isomorphism over the rationals and over an algebraic closure thereof, that admit a cyclic isogeny of degree $7$.

Isogenies, the mappings of elliptic curves, have become a useful tool in cryptology. These mathematical objects have been proposed for use in computing pairings, constructing hash functions and random number generators, and analyzing the…

We prove a character sum identity for Coxeter arrangements which is a finite field analogue of Macdonald's conjecture proved by Opdam.