Related papers: Fast algorithms for computing isogenies between el…

We discuss the computation of coefficients of the L-series associated to a hyperelliptic curve over Q of genus at most 3, using point counting, generic group algorithms, and p-adic methods.

We present an algorithm that, on input of a positive integer N together with its prime factorization, constructs a finite field F and an elliptic curve E over F for which E(F) has order N. Although it is unproved that this can be done for…

We address complexity issues for linear differential equations in characteristic $p>0$: resolution and computation of the $p$-curvature. For these tasks, our main focus is on algorithms whose complexity behaves well with respect to $p$. We…

By reformulating and extending results of Elkies, we prove some results on $\mathbb Q$-curves over number fields of odd degree. We show that, over such fields, the only prime isogeny degrees~$\ell$ which an elliptic curve without CM may…

Let $E$ be an elliptic curve defined over a field $K$ (with $char(K)\neq 2$) given by a Weierstrass equation and let $P=(x,y)\in E(K)$ be a point. Then for each $n$ $\geq 1$ and some $\gamma \in K^{\ast }$ we can write the $x$- and…

This paper presents algorithmic approaches to study superspecial hyperelliptic curves. The algorithms proposed in this paper are: an algorithm to enumerate superspecial hyperelliptic curves of genus $g$ over finite fields $\mathbb{F}_q$,…

We study elliptic surfaces over $\mathbb{Q}(T)$ with coefficients of a Weierstrass model being polynomials in $\mathbb{Q}[T]$ with degree at most 2. We derive an explicit expression for their rank over $\mathbb{Q}(T)$ depending on the…

We recall and define various kinds of supersingular $\ell$-isogeny graphs and precise graph isomorphism with a corresponding quaternion $\ell$-ideal graph. In particular, we introduce the notion of double-orientations on supersingular…

We demonstrate a new approach to the computation of ratios of elliptic integrals. It turns out that almost closed polygons interscribed between two conics retain some of the properties of such closed polygons. We apply these retained…

We propose a fast fourth-order cut cell method for solving constant-coefficient elliptic equations in two-dimensional irregular domains. In our methodology, the key to dealing with irregular domains is the poised lattice generation (PLG)…

Using Galois representations, we analyze fields of definition of cyclic isogenies on elliptic curves to prove the following uniformity result: for any number field $F$ which has no rational CM, under GRH there exists an effectively…

An isogeny graph is a graph whose vertices are principally polarized abelian varieties and whose edges are isogenies between these varieties. In his thesis, Kohel described the structure of isogeny graphs for elliptic curves and showed that…

We introduce an algorithm that can be used to compute the canonical height of a point on an elliptic curve over the rationals in quasi-linear time. As in most previous algorithms, we decompose the difference between the canonical and the…

We present a heuristic asymptotic formula as $x\to \infty$ for the number of isogeny classes of pairing-friendly elliptic curves with fixed embedding degree $k\geq 3$, with fixed discriminant, with rho-value bounded by a fixed $\rho_0$ such…

We apply classical invariant theory of binary forms to explicitly characterize isomorphism classes of hyperelliptic curves of small genus and, conversely, propose algorithms for reconstructing hyperelliptic models from given invariants. We…

We show that the distribution of elliptic curves in isogeny classes of curves with a given value of the Frobenius trace $t$ becomes close to uniform even when $t$ is averaged over very short intervals inside the Hasse-Weil interval.

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…

Geometry and topology have generated impacts far beyond their pure mathematical primitive, providing a solid foundation for many applicable tools. Typically, real-world data are represented as vectors, forming a linear subspace for a given…

A Howe curve is a curve of genus $4$ obtained as the fiber product of two genus-$1$ double covers of $\mathbf{P}^1$. In this paper, we present a simple algorithm for testing isomorphism of Howe curves, and we propose two main algorithms for…

The remarkable structure and computationally explicit form of isogeny graphs of elliptic curves over a finite field has made them an important tool for computational number theorists and practitioners of elliptic curve cryptography. This…