Related papers: Modular polynomials for genus 2

We propose to generalize the work of R\'egis Dupont for computing modular polynomials in dimension $2$ to new invariants. We describe an algorithm to compute modular polynomials for invariants derived from theta constants and prove under…

We present a new probabilistic algorithm to compute modular polynomials modulo a prime. Modular polynomials parameterize pairs of isogenous elliptic curves and are useful in many aspects of computational number theory and cryptography. Our…

The classical modular polynomial for $j$-invariants describes the relation between two elliptic curves connected by isogenies. This polynomial has been applied to various algorithms in computational number theory, such as point counting on…

Genus 2 curves have been an object of much mathematical interest since eighteenth century and continued interest to date. They have become an important tool in many algorithms in cryptographic applications, such as factoring large numbers,…

Motivated by finding analogues of elliptic curve point counting techniques, we introduce one deterministic and two new Monte Carlo randomized algorithms to compute the characteristic polynomial of a finite rank-two Drinfeld module. We…

Genus 2 curves are useful in cryptography for both discrete-log based and pairing-based systems, but a method is required to compute genus 2 curves such that the Jacobian has a given number of points. Currently, all known methods involve…

The Hilbert class polynomial has as roots the j-invariants of elliptic curves whose endomorphism ring is a given imaginary quadratic order. It can be used to compute elliptic curves over finite fields with a prescribed number of points.…

Orthogonal polynomials in two variables on cubic curves are considered, including the case of elliptic curves. For an integral with respect to an appropriate weight function defined on a cubic curve, an explicit basis of orthogonal…

We discuss many analogy points with the elliptic curves. more precisely, we study the characteristic polynomial of a Drinfeld module of rank 2 and use it to calculate the number of isogeny classes for such modules.

We study genus 2 function fields with elliptic subfields of degree 2. The locus $\L_2$ of these fields is a 2-dimensional subvariety of the moduli space $\mathcal M_2$ of genus 2 fields. An equation for $\L_2$ is already in the work of…

Explicit models of families of genus 2 curves with multiplication by $\sqrt D$ are known for $D= 2, 3, 5$. We obtain generic models for genus 2 curves over $\mathbb Q$ with real multiplication in 12 new cases, including all fundamental…

We present an algorithm solving the following problem: given two genus 2 curves over a field k with isogenous Jacobians, compute such an isogeny explicitly. This isogeny can be either an l-isogeny or, in the real multiplication case, an…

We describe the ring of modular forms of degree 2 in characteristic 2 using its relation with curves of genus 2.

Inspired by work done for systems of polynomial exponential equations, we study systems of equations involving the modular $j$ function. We show general cases in which these systems have solutions, and then we look at certain situations in…

In this paper we generalize the classical Groebner basis technique to prove the existence and present a method of computation of a dimension polynomial in two variables associated with a finitely generated D-module, that is, a finitely…

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…

The analogous quaternionic polynomials of a class of bivariate orthogonal polynomials (arXiv: 1502.07256, 2014) introduced. The ladder operators for these quaternionic polynomials also studied. For the quaternionic case, the ladder…

We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions and on interpolation, which has received little attention in…

We present several new algorithms to evaluate modular polynomials of level $\ell$ modulo a prime $p$ on an input $j$. More precisely, we introduce two new generic algorithms, sharing the following similarities: they are based on a CRT…

Inside the moduli space of curves of genus 2 with 2 marked points we consider the loci of curves admitting a map to P^1 of degree d totally ramified over the two marked points, for d>= 2. Such loci have codimension two. We compute the class…