Related papers: Rigorous computation of the endomorphism ring of a…

Elliptic curves have a well-known and explicit theory for the construction and application of endomorphisms, which can be applied to improve performance in scalar multiplication. Recent work has extended these techniques to hyperelliptic…

A survey on algorithms for computing discrete logarithms in Jacobians of curves over finite fields.

We give practical numerical methods to compute the period matrix of a plane algebraic curve (not necessarily smooth). We show how automorphisms and isomorphisms of such curves, as well as the decomposition of their Jacobians up to isogeny,…

We describe an algorithm, based on the properties of the characteristic polynomials of Frobenius, to compute $\operatorname{End}_{\overline{K}}(A)$ when $A$ is the Jacobian of a nice genus-2 curve over a number field $K$. We use this…

We present algorithms which, given a genus 2 curve $C$ defined over a finite field and a quartic CM field $K$, determine whether the endomorphism ring of the Jacobian $J$ of $C$ is the full ring of integers in $K$. In particular, we present…

We study endomorphism rings of principally polarized abelian surfaces over finite fields from a computational viewpoint with a focus on exhaustiveness. In particular, we address the cases of non-ordinary and non-simple varieties. For each…

We give an efficient, deterministic algorithm to decide if two abelian varieties over a number field are isogenous. From this, we derive an algorithm to compute the endomorphism ring of an elliptic curve over a number field.

We describe deterministic and probabilistic algorithms to determine whether or not a given monic irreducible polynomial H in Z[X] is a Hilbert class polynomial, and if so, which one. These algorithms can be used to determine whether a given…

We classify the endomorphism algebras of factors of the Jacobian of certain hypergeometric curves over a field of characteristic zero. Other than a few exceptional cases, the endomorphism algebras turn out to be either a cyclotomic field…

We consider the problem of checking whether an elliptic curve defined over a given number field has complex multiplication. We study two polynomial time algorithms for this problem, one randomized and the other deterministic. The randomized…

This article gives an introduction for mathematicians interested in numerical computations in algebraic geometry and number theory to some recent progress in algorithmic number theory, emphasising the key role of approximate computations…

We present a new algorithm for computing the endomorphism ring of an ordinary abelian surface over a finite field which is subexponential and generalizes an algorithm of Bisson and Sutherland for elliptic curves. The correctness of this…

Generalizing a method of Sutherland and the author for elliptic curves, we design a subexponential algorithm for computing the endomorphism rings of ordinary abelian varieties of dimension two over finite fields. Although its correctness…

We present two algorithms to compute the endomorphism ring of an ordinary elliptic curve E defined over a finite field F_q. Under suitable heuristic assumptions, both have subexponential complexity. We bound the complexity of the first…

We design a probabilistic algorithm for computing endomorphism rings of ordinary elliptic curves defined over finite fields that we prove has a subexponential runtime in the size of the base field, assuming solely the generalized Riemann…

We present an efficient endomorphism for the Jacobian of a curve $C$ of genus 2 (hyperelliptic) for divisors having a Non disjoint support. This extends the work of Costello and Lauter in [12] who calculated explicit formulae for divisor…

Given a curve defined over an algebraically closed field which is complete with respect to a nontrivial valuation, we study its tropical Jacobian. This is done by first tropicalizing the curve, and then computing the Jacobian of the…

This paper is concerned with the complexity and stability of arithmetic operations in the jacobian variety of curves over the field of complex numbers, as the genus grows to infinity. We focus on modular curves. Efficient and stable…

The action of ring automorphisms of the polynomial ring in two variables over the real numbers on real plane curves is considered. The orbits containing degree-three polynomials are computed, with one representative per orbit being…

We study the endomorphism ring $End(J(C))$ of the complex jacobian $J(C)$ of a curve $y^p=f(x)$ where $p$ is an odd prime and $f(x)$ is a polynomial with complex coefficiens of degree $n>4$ and without multiple roots. Assume that all the…