Related papers: Counting Points on Genus 2 Curves with Real Multip…

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.

The main purpose of this paper is to give an overview over the theory of abelian varieties, with main focus on Jacobian varieties of curves reaching from well-known results till to latest developments and their usage in cryptography. In the…

This paper examines the arithmetic of the loci \(\cL_n\), parameterizing genus 2 curves with \((n, n)\)-split Jacobians over finite fields \(\F_q\). We compute rational points \(|\cL_n(\F_q)|\) over \(\F_3\), \(\F_9\), \(\F_{27}\),…

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…

Let $C/\mathbb{Q}$ be a genus $2$ curve whose Jacobian $J/\mathbb{Q}$ has real multiplication by a quadratic order in which $7$ splits. We describe an algorithm which outputs twists of the Klein quartic curve which parametrise elliptic…

We give algorithms for computing with divisors on projective curves over finite fields, and with their Jacobians, using the algorithmic representation of projective curves developed by Khuri-Makdisi. We show that many desirable operations…

Let $X$ (resp. $Y$) be a curve of genus 1 (resp. 2) over a base field $k$ whose characteristic does not equal 2. We give criteria for the existence of a curve $Z$ over $k$ whose Jacobian is up to twist (2,2,2)-isogenous to the products of…

Let E_G be a family of hyperelliptic curves defined by Y^2=Q(X,G), where Q is defined over a small finite field of odd characteristic. Then with g in an extension degree n field over this small field, we present a deterministic algorithm…

We present an algorithm that, for every fixed genus $g$, will enumerate all hyperelliptic curves of genus $g$ over a finite field $k$ of odd characteristic in quasilinear time; that is, the time required for the algorithm is…

In this work, we present an efficient method for computing in the Generalized Jacobian of special singular curves. The efficiency of the operation is due to representation of an element in the Jacobian group by a single polynomial.

Multiplication is an essential step in a lot of calculations. In this paper we look at multiplication of 2 binary polynomials of degree at most $n-1$, modulo an irreducible polynomial of degree $n$ with $2n$ input and $n$ output qubits,…

In this paper, we consider the hyperelliptic analogue of the Frobenius endomorphism generator and show that it produces sequences with large linear complexity on the Jacobian of genus 2 curves.

We construct Weil numbers corresponding to genus-2 curves with $p$-rank 1 over the finite field $\F_{p^2}$ of $p^2$ elements. The corresponding curves can be constructed using explicit CM constructions. In one of our algorithms, the group…

In this work we propose an algorithm that numerically evaluates Kleinian hyperelliptic functions associated with a complex curve of genus 2. This algorithm is based upon constructing a sequence of curves with Richelot isogenous Jacobians…

Multiplication over binary fields is a crucial operation in quantum algorithms designed to solve the discrete logarithm problem for elliptic curve defined over $GF(2^n)$. In this paper, we present an algorithm for constructing quantum…

Genus 5 curves can be hyperelliptic, trigonal, or non-hyperelliptic non-trigonal, whose model is a complete intersection of three quadrics in $\mathbb{P}^4$. We present and explain algorithms we used to determine, up to isomorphism over…

Let $X$ be a smooth projective curve over a finite field of characteristic $p$. We describe and implement a practical algorithm for computing the $p$-divisible group $Jac(X)[p^\infty]$ via computing its Dieudonn\'{e} module, or equivalently…

Let $k,p\in \mathbb{N}$ with $p$ prime and let $f\in\mathbb{Z}[x_1,x_2]$ be a bivariate polynomial with degree $d$ and all coefficients of absolute value at most $p^k$. Suppose also that $f$ is variable separated, i.e., $f=g_1+g_2$ for…

We describe a practical algorithm to compute the (oriented) genus of a graph, give results of the program implementing this algorithm, and compare the performance to existing algorithms. The aim of this algorithm is to be fast enough for…

Working over an algebraically closed field of arbitrary characteristic we study, for integers $N\geq 2$ and $g\geq 2$, the set of points of order dividing $N$ lying on an irreducible smooth proper curve of genus $g$ embedded in its jacobian…