Related papers: A CRT algorithm for constructing genus 2 curves ov…

Let $\mathbb F_{q^2}$ be the finite field with $q^2$ elements. We provide a simple and effective method, using reciprocal polynomials, for the construction of algebraic curves over $\mathbb F_{q^2}$ with many rational points. The curves…

We show that a genus $2$ curve over a number field whose jacobian has complex multiplication will usually have stable bad reduction at some prime. We prove this by computing the Faltings height of the jacobian in two different ways. First,…

In this paper we present an iterative construction of irreducible polynomials over finite fields based upon repeated applications of transforms induced by endomorphisms of odd prime degree of ordinary elliptic curves.

We prove that in most cases relevant to cryptography, the Frobenius endomorphism on the Jacobian of a genus two curve is represented by a diagonal matrix with respect to an appropriate basis of the subgroup of l-torsion points. From this…

Primitive polynomials over finite fields are crucial for various domains of computer science, including classical pseudo-random number generation, coding theory and post-quantum cryptography. Nevertheless, the pursuit of an efficient…

We adapt the CRT approach for computing Hilbert class polynomials to handle a wide range of class invariants. For suitable discriminants D, this improves its performance by a large constant factor, more than 200 in the most favourable…

Enge and Schertz gave the method of using the double eta-quotient for the construction of elliptic curves over finite fields. In their method, it is necessary to count the number of rational points of elliptic curves corresponding to…

We give practical algorithms for computing the divisor class group and the gonality of a curve over a finite field, achieving several orders of magnitude speedup over existing methods for sufficiently large genus or residue field. The…

We discuss methods for using the Weil polynomial of an isogeny class of abelian varieties over a finite field to determine properties of the curves (if any) whose Jacobians lie in the isogeny class. Some methods are strong enough to show…

We present several new heuristic algorithms to compute class polynomials and modular polynomials modulo a prime $p$ by revisiting the idea of working with supersingular elliptic curves. The best known algorithms to this date are based on…

We study the Selmer variety associated to a canonical quotient of the $\Q_p$-pro-unipotent fundamental group of a smooth projective curve of genus at least two defined over $\Q$ whose Jacobian decomposes into a product of abelian varieties…

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…

Consider a genus 2 curve defined over $\mathbb{Q}$ given by an affine equation of the form $y^2 = f(x)$ for some polynomial $f$ of degree 5, and let $p$ be an odd prime. Extending work of Perrin-Riou for elliptic curves, we construct a…

We generalize an algorithm established in earlier work \cite{algebrapaper} to compute finitely many generators for a subgroup of finite index of an arithmetic group acting properly discontinuously on hyperbolic space of dimension $2$ and…

This paper studies the task of two-sources randomness extractors for elliptic curves defined over finite fields $K$, where $K$ can be a prime or a binary field. In fact, we introduce new constructions of functions over elliptic curves which…

In this paper we prove an explicit formula for the arithmetic intersection number (CM(K).G1)_{\ell} on the Siegel moduli space of abelian surfaces, generalizing the work of Bruinier-Yang and Yang. These intersection numbers allow one to…

We construct three families of pairs of genus 2 curves over a field K, whose Jacobians are isomorphic as unpolarized abelian varieties. Each family is parameterized by an open subset of the Projective line over K. Our construction is based…

We describe an efficient algorithm which, given a principally polarized (p.p.) abelian surface $A$ over $\mathbb{Q}$ with geometric endomorphism ring equal to $\mathbb{Z}$, computes all the other p.p. abelian surfaces over $\mathbb{Q}$ that…

Let E be an elliptic curve having complex multiplication by a given quadratic order of an imaginary quadratic field K. The field of definition of E is the ring class field Omega of the order. If the prime p splits completely in Omega, then…

We present a method for computing the Mordell-Weil rank of the jacobian of a curve of genus 2 with multiplication by a square root of 2, based on descent via isogenies of degree 2, and apply it to a family of curves.